DocumentCode
3119523
Title
Multi Objective Higher Order Mutation Testing with Genetic Programming
Author
Langdon, William B. ; Harman, Mark ; Jia, Yue
Author_Institution
Dept. of Comput. Sci., King´´s Coll. London, London, UK
fYear
2009
fDate
4-6 Sept. 2009
Firstpage
21
Lastpage
29
Abstract
In academic empirical studies, mutation testing has been demonstrated to be a powerful technique for fault finding. However, it remains very expensive and the few valuable traditional mutants that resemble real faults are mixed in with many others that denote unrealistic faults.These twin problems of expense and realism have been a significant barrier to industrial uptake of mutation testing. Genetic programming is used to search the space of complex faults (higher order mutants). The space is much larger than the traditional first order mutation space of simple faults. However, the use of a search based approach makes this scalable, seeking only those mutants that challenge the tester, while the consideration of complex faults addresses the problem of fault realism; it is known that 90% of real faults are complex (i.e. higher order). We show that we are able to find examples that pose challenges to testing in the higher order space that cannot be represented in the first order space.
Keywords
genetic algorithms; program testing; software fault tolerance; fault finding; fault injection technique; genetic programming; multiobjective higher order mutation testing; search based approach; Arithmetic; Benchmark testing; Computer industry; Computer science; Educational institutions; Genetic mutations; Genetic programming; Heart; Performance evaluation; Programming profession; Pareto optimality; genetic programming; higher order mutation; mutation testing; schedule; tcas; triangle;
fLanguage
English
Publisher
ieee
Conference_Titel
Testing: Academic and Industrial Conference - Practice and Research Techniques, 2009. TAIC PART '09.
Conference_Location
Windsor
Print_ISBN
978-0-7695-3820-4
Type
conf
DOI
10.1109/TAICPART.2009.18
Filename
5381650
Link To Document