DocumentCode
147916
Title
Mutant Subsumption Graphs
Author
Kurtz, Bob ; Ammann, Paul ; Delamaro, Marcio E. ; Offutt, Jeff ; Lin Deng
Author_Institution
Software Eng., George Mason Univ., Fairfax, VA, USA
fYear
2014
fDate
March 31 2014-April 4 2014
Firstpage
176
Lastpage
185
Abstract
Mutation testing researchers have long known that many generated mutants are not needed. This paper develops a graph model to describe redundancy among mutations. We define "true" subsumption, a relation that practicing test engineers would like to have, but cannot due to issues of computability. We also define dynamic subsumption and static subsumption as approximations of "true" subsumption. We explore the properties of the approximate subsumption relations in the context of a small example. We suggest possible uses for subsumption graphs.
Keywords
computability; graph theory; program testing; redundancy; computability; dynamic subsumption; generated mutants; graph model; mutant subsumption graphs; mutation testing researcher; redundancy; static subsumption; subsumption relation; true subsumption; Approximation methods; Complexity theory; Conferences; Context; Maintenance engineering; Redundancy; Testing; mutation testing; subsumption;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Testing, Verification and Validation Workshops (ICSTW), 2014 IEEE Seventh International Conference on
Conference_Location
Cleveland, OH
Type
conf
DOI
10.1109/ICSTW.2014.20
Filename
6825656
Link To Document