63,298 research outputs found
Recommended from our members
Using formal methods to support testing
Formal methods and testing are two important approaches that assist in the development of high quality software. While traditionally these approaches have been seen as rivals, in recent
years a new consensus has developed in which they are seen as complementary. This article reviews the state of the art regarding ways in which the presence of a formal specification can be used to assist testing
Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms
The authors propose the implementation of hybrid Fuzzy Logic-Genetic
Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly
sequence of products. The GA-Fuzzy Logic approach is implemented onto two
levels. The first level of hybridization consists of the development of a Fuzzy
controller for the parameters of an assembly or disassembly planner based on
GAs. This controller acts on mutation probability and crossover rate in order
to adapt their values dynamically while the algorithm runs. The second level
consists of the identification of theoptimal assembly or disassembly sequence
by a Fuzzy function, in order to obtain a closer control of the technological
knowledge of the assembly/disassembly process. Two case studies were analyzed
in order to test the efficiency of the Fuzzy-GA methodologies
Performance of algebraic multigrid methods for non-symmetric matrices arising in particle methods
Large linear systems with sparse, non-symmetric matrices arise in the
modeling of Markov chains or in the discretization of convection-diffusion
problems. Due to their potential to solve sparse linear systems with an effort
that is linear in the number of unknowns, algebraic multigrid (AMG) methods are
of fundamental interest for such systems. For symmetric positive definite
matrices, fundamental theoretical convergence results are established, and
efficient AMG solvers have been developed. In contrast, for non-symmetric
matrices, theoretical convergence results have been provided only recently. A
property that is sufficient for convergence is that the matrix be an M-matrix.
In this paper, we present how the simulation of incompressible fluid flows with
particle methods leads to large linear systems with sparse, non-symmetric
matrices. In each time step, the Poisson equation is approximated by meshfree
finite differences. While traditional least squares approaches do not guarantee
an M-matrix structure, an approach based on linear optimization yields
optimally sparse M-matrices. For both types of discretization approaches, we
investigate the performance of a classical AMG method, as well as an AMLI type
method. While in the considered test problems, the M-matrix structure turns out
not to be necessary for the convergence of AMG, problems can occur when it is
violated. In addition, the matrices obtained by the linear optimization
approach result in fast solution times due to their optimal sparsity.Comment: 16 pages, 7 figure
Formal Verification of Security Protocol Implementations: A Survey
Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approac
- …