DMCA
Exploring Very Large State Spaces Using (2002)
Cached
Download Links
- [sdg.lcs.mit.edu]
- [sdg.csail.mit.edu]
- [alloy.mit.edu]
- DBLP
Other Repositories/Bibliography
BibTeX
@INPROCEEDINGS{Patrice02exploringvery,
author = {Genetic Algorithms Patrice and Patrice Godefroid and Sarfraz Khurshid},
title = {Exploring Very Large State Spaces Using},
booktitle = {},
year = {2002},
pages = {266--280},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a novel framework for exploring very large state spaces of concurrent reactive systems. Our framework exploits applicationindependent heuristics using genetic algorithms to guide a state-space search towards error states. We have implemented this framework in conjunction with VeriSoft, a tool for exploring the state spaces of software applications composed of several concurrent processes executing arbitrary code. We present experimental results obtained with several examples of programs, including a C implementation of a public-key authentication protocol. We discuss heuristics and properties of state spaces that help a genetic search detect deadlocks and assertion violations. For finding errors in very large state spaces, our experiments show that a genetic search using simple heuristics can significantly outperform random and systematic searches.
Keyphrases
large state space state space systematic search genetic search assertion violation genetic algorithm novel framework simple heuristic several concurrent process concurrent reactive system arbitrary code genetic search detect deadlock present experimental result software application several example public-key authentication protocol applicationindependent heuristic state-space search towards error state
