A Factorial Experiment on Scalability of Search Based Software Testing
by A. Mehrmand and R. Feldt
PDF
ArkivX Page
Software testing is an expensive process, which is vital in the industry. Construction of the test data in software testing requires the major cost and to decide which method to use in order to generate the test data is important. This paper discusses the efficiency of search-based algorithms (preferably genetic algorithm) versus random testing, in software test data generation. This study differs from all previous studies due to sample programs (SUTs) which are used. Since we want to increase the complexity of SUTs gradually, and the program generation is automatic as well, Grammatical Evolution is used to guide the program generation. SUTs are generated according to the grammar we provide, with different levels of complexity. SUTs will first undergo genetic algorithm and then random testing. Based on the test results, this paper recommends one method to use for automation of software testing.
Bibtex
@InProceedings{Mehrmand2010Factorial,
author = "Arash Mehrmand and Robert Feldt",
title = {A Factorial Experiment on Scalability of Search Based Software Testing},
year = "2010",
booktitle = "Proceedings of the Artificial Intelligence Techniques in Software Engineering Workshop",
pages = "",
publisher = "",
keywords = "Software Engineering; Verification and Validation; Search-Based Software Testing; Empirical study",
url = "http://www.cse.chalmers.se/~feldt/publications/mehrmand_2010_aisew.html",
}