Search-Based Software Testing: Past, Present and Future

Authors:
Phil McMinn
Affiliations:
-
Venue:
ICSTW '11 Proceedings of the 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops
Year:
2011

Citing 0
Cited 6

Search based software engineering: techniques, taxonomy, tutorial

Empirical Software Engineering and Verification
A concept for an interactive search-based software testing system

SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Evolutionary functional black-box testing in an industrial setting

Software Quality Control
Automated test data generation for branch testing using genetic algorithm: An improved approach using branch ordering, memory and elitism

Journal of Systems and Software
Software engineering: an ideal set of challenges for evolutionary computation

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
An orchestrated survey of methodologies for automated software test case generation

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

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.