Symbolic Model Checking
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Genetic Algorithms for Protocol Validation
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
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
Finding safety errors with ACO
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Information Processing Letters
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Searching for liveness property violations in concurrent systems with ACO
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Finding deadlocks in large concurrent java programs using genetic algorithms
Proceedings of the 10th annual conference on Genetic and evolutionary computation
JPF-SE: a symbolic execution extension to Java PathFinder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A linear estimation-of-distribution GP system
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Searching for Safety Violations Using Estimation of Distribution Algorithms
ICSTW '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification, and Validation Workshops
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
| Hi-index | 0.00 |
Model checking is an automatic technique that exhaustively checks the state space of a system/program to prove if a specification is satisfied. If an error is detected, the precise circumstances of the issue are returned to the user in the form of a counterexample. Exhaustively checking the state space of a large system, a system with many concurrent components for example, is often intractable. In this scenario, heuristic mechanisms can be employed with the task of detecting errors rather than proving the system is correct. Recently, a metaheuristic EDA-based approach to detecting deadlock in multithreaded Java software has shown great promise in this area. In this paper, we extend that work to search Promela models for counterexamples. We show that the EDA-based technique can find errors where algorithms such as A* search fail. We also show the ability of the EDA to find shorter errors than those discovered by traditional heuristic methods.