ACM Home Page
Please provide us with feedback. Feedback
Multi objective higher order mutation testing with GP
Full text PdfPdf (313 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 14: search based software engineering table of contents
Pages 1945-1946  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
William B. Langdon  King's College, London, London, ID, Bahamas
Mark Harman  King's College, London, London, AA, APO AA
Yue Jia  King's College, London, London, AA, APO AA
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570251
What is a DOI?

ABSTRACT

Mutation testing is a powerful software engineering technique for fault finding. It works by injecting known faults (mutations) into software and seeing if the test suite finds them. It remains very expensive and the few valuable traditional mutants that resemble real faults are mixed in with many others that denote unrealistic faults. The expense and lack of realism inhibit industrial uptake of mutation testing. Genetic programming searches the space of complex faults to find realistic higher order mutants. Despite the much larger search space, we have found mutants composed of multiple changes to the C source code that challenge the tester and which cannot be represented in the first order space.


Collaborative Colleagues:
William B. Langdon: colleagues
Mark Harman: colleagues
Yue Jia: colleagues