Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Finding safety errors with ACO
Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
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
Finding short counterexamples in promela models using estimation of distribution algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Previous work has shown the efficacy of using Estimation of Distribution Algorithms (EDAs) to detect faults in concurrent software/ systems. A promising feature of EDAs is the ability to analyse the information or model learned from any particular execution. The analysis performed can yield insights into the target problem allowing practitioners to adjust parameters of the algorithm or indeed the algorithm itself. This can lead to a saving in the effort required to perform future executions, which is particularly important when targeting expensive fitness functions such as searching concurrent software state spaces. In this work, we describe practical scenarios related to detecting concurrent faults in which reusing information discovered in EDA runs can save effort in future runs, and prove the potential of such reuse using an example scenario. The example scenario consists of examining problem families, and we provide empirical evidence showing real effort saving properties for three such families.