The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Genetic Algorithms for Protocol Validation
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Verification and Specifications of Concurrent Programs
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Hierarchical ordering of sequential processes
The origin of concurrent programming
Symbolic Model Checking for Sequential Circuit Verification
Symbolic Model Checking for Sequential Circuit Verification
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Exploring very large state spaces using genetic algorithms
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Computation Engineering: Applied Automata Theory and Logic
Computation Engineering: Applied Automata Theory and Logic
Finding safety errors with ACO
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
Applying Evolutionary Computation Methods to Formal Testing and Model Checking
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Finding short counterexamples in promela models using estimation of distribution algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Comparing metaheuristic algorithms for error detection in java programs
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Search-based software engineering: Trends, techniques and applications
ACM Computing Surveys (CSUR)
Testing of concurrent programs using genetic algorithms
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Automatic generation of basis test paths using variable length genetic algorithm
Information Processing Letters
| Hi-index | 0.00 |
Model checking is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. However, the state explosion problem limits the size of the models that are possible to check. Genetic Algorithms (GAs) are metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space. Unlike exact techniques, metaheuristic techniques cannot be used to verify that a program satisfies a given property, but they can find errors on the software using a lower amount of resources than exact techniques. In this paper, we compare a GA against classical exact techniques and we propose a new operator for this problem, called memory operator, which allows the GA to explore even larger search spaces. We implemented our ideas in the Java PathFinder (JPF) model checker to validate them and present our results. To the best of our knowledge, this is the first implementation of a Genetic Algorithm in this model checker.