Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A Markov Chain Model for Statistical Software Testing
IEEE Transactions on Software Engineering
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computational Intelligence in Software Engineering
Computational Intelligence in Software Engineering
On the many ways software engineering can benefit from knowledge engineering
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Java PathFinder, A Translator from Java to Promela
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Exploring Very Large State Spaces Using Genetic Algorithms
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Ant Colony Optimization
High Volume Software Testing using Genetic Algorithms
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Finding safety errors with ACO
Proceedings of the 9th 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
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Applying Evolutionary Techniques to Debug Functional Programs
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Creation of Specific-to-Problem Kernel Functions for Function Approximation
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Combining Genetic Algorithms and Mutation Testing to Generate Test Sequences
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Testing Restorable Systems by Using RFD
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Extracting test sequences from a Markov software usage model by ACO
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
The state problem for evolutionary testing
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Formal Methods (FM) provide mathematically founded algorithms for analyzing the correctness of systems. Though FM have been successfully applied to many industrial problems, these methods typically find the practical problem that the number of states to be systematically analyzed grows exponentially with the size of the system to be analyzed. Thus, exhaustive techniques to find system faults are typically substituted by heuristic strategies allowing to focalize the search for potential faults in some suspicious or critical configurations. In particular, Evolutionary Computation (EC) methods provide efficient generic strategies to search for good solutions in big solution spaces, which fit into the kind of problems appearing in FM. This paper summarizes several works where EC techniques have been applied to FM problems.