Abstract
This paper introduces the Species per Path approach to search-based software test data generation. The approach transforms the program under test into a version in which multiple paths to the search target are factored out. Test data are then sought for each individual path by dedicated 'species' operating in parallel. The factoring out of paths results in several individual search landscapes, with feasible paths giving rise to landscapes that are potentially more conducive to test data discovery than the original overall landscape.The paper presents the results of two empirical studies that validate and verify the approach. The validation study supports the claim that the approach is widely applicable and practical. The verification study shows that it is possible to generate test data for targets with the approach that are troublesome for the standard evolutionary method.
| Original language | English |
|---|---|
| Title of host publication | ISSTA '06 |
| Subtitle of host publication | Proceedings of the 2006 international symposium on Software testing and analysis |
| Place of Publication | New York, NY |
| Publisher | ACM |
| Pages | 13-24 |
| Number of pages | 12 |
| ISBN (Print) | 1595932631 |
| DOIs | |
| Publication status | Published - 2006 |