ACM Home Page
Please provide us with feedback. Feedback
Finding deadlocks in large concurrent java programs using genetic algorithms
Full text PdfPdf (279 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Search-based software engineering papers table of contents
Pages 1735-1742  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Enrique Alba  University of Málaga, Málaga, Spain
Francisco Chicano  University of Málaga, Málaga, Spain
Marco Ferreira  Instituto Politecnico de Leiria, Leiria, Portugal
Juan Gomez-Pulido  University of Extremadura, Caceres, Spain
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 81,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389432
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
 
5
E. Clarke, O. Grumberg, M. Minea, and D. Peled. State space reduction using partial order techniques. International Journal on Software Tools for Technology Transfer (STTT), 2(3):279--287, 1999.
 
6
 
7
 
8
 
9
A. Groce and W. Visser. Heuristics for model checking java programs. International Journal on Software Tools for Technology Transfer (STTT), 6(4):260--276, 2004.
 
10
 
11
A. L. Lafuente. Symmetry reduction and heuristic search for error detection in model checking. Workshop on Model Checking and Artificial Intelligence, August 2003.
 
12
 
13
D. J. Sheskin. Handbook of Parametric and Nonparametric Statistical Procedures. Chapman & Hall/CRC, 2007.
 
14
M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 32(3):33--55, 2001.

Collaborative Colleagues:
Enrique Alba: colleagues
Francisco Chicano: colleagues
Marco Ferreira: colleagues
Juan Gomez-Pulido: colleagues