Search-Based Software Testing: Past, Present and Future
Author:
- Phil McMinnPMPhil McMinn
Top Cited Papers
- 1 March 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 153-163
Abstract
Search-Based Software Testing is the use of a meta-heuristic optimizing search technique, such as a Genetic Algorithm, to automate or partially automate a testing task, for example the automatic generation of test data. Key to the optimization process is a problem-specific fitness function. The role of the fitness function is to guide the search to good solutions from a potentially infinite search space, within a practical time limit. Work on Search-Based Software Testing dates back to 1976, with interest in the area beginning to gather pace in the 1990s. More recently there has been an explosion of the amount of work. This paper reviews past work and the current state of the art, and discusses potential future research areas and open problems that remain in the field.Keywords
This publication has 44 references indexed in Scilit:
- An empirical investigation into branch coverage for C programs using CUTE and AUSTINJournal of Systems and Software, 2010
- It Does Matter How You Normalise the Branch Distance in Search Based Software Testing2010
- Empirical evaluation of a nesting testability transformation for evolutionary testingACM Transactions on Software Engineering and Methodology, 2009
- Automated Test Data Generation for Coverage: Haven't We Solved This Problem Yet?2009
- Handling dynamic data structures in search based testing2008
- Evolutionary testing of classes2004
- Evolutionary testing in the presence of loop-assigned flags2004
- An automated framework for structural test-data generation2002
- Evolutionary test environment for automatic structural testingInformation and Software Technology, 2001
- A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing ConstraintsReal-Time Systems, 2001