Genetic algorithms for dynamic test data generation
Authors:
- G.E. McGrawGMG.E. McGraw
- M.A. SchatzMSM.A. Schatz
- C.C. WaltonCWC.C. Walton
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 307-308
Abstract
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially when the software is complex. Therefore, numerous attempts have been made to automate the process. Random test data generation consists of generating test inputs at random, in the hope that they will exercise the desired software features. Often, the desired inputs must satisfy complex constraints, and this makes a random approach seem unlikely to succeed. In contrast, combinatorial optimization techniques, such as those using genetic algorithms, are meant to solve difficult problems involving the simultaneous satisfaction of many constraints. In this paper, we discuss experiments with a test generation problem that is harder than the ones discussed in earlier literature-we use a larger program and more complex test adequacy criteria. We find a widening gap between a technique based on genetic algorithms and those based on random test generation.Keywords
This publication has 4 references indexed in Scilit:
- Automated test data generation for programs with procedures1996
- Automated software test data generationIEEE Transactions on Software Engineering, 1990
- Tabu Search Applied to the Quadratic Assignment ProblemINFORMS Journal on Computing, 1990
- Optimization by Simulated AnnealingScience, 1983