DocumentCode
2228808
Title
Finding Sufficient Mutation Operators via Variable Reduction
Author
Namin, Akbar Siami ; Andrews, James H.
Author_Institution
Dept. of Comput. Sci., Univ. of Western Ontario, London, ON
fYear
2006
fDate
7-10 Nov. 2006
Firstpage
5
Lastpage
5
Abstract
A set of mutation operators is "sufficient" if it can be used for most purposes to replace a larger set. We describe in detail an experimental procedure for determining a set of sufficient C language mutation operators. We also describe several statistical analyses that determine sufficient subsets with respect to several different criteria, based on standard techniques for variable reduction. We have begun to carry out our experimental procedure on seven standard C subject programs. We present preliminary results that indicate that the procedure and analyses are feasible and yield useful information.
Keywords
C language; program diagnostics; program testing; statistical analysis; C language mutation operator set; mutation analysis; mutation testing; statistical analysis; variable reduction; Computer science; Genetic mutations; Information analysis; Java; Performance analysis; Performance evaluation; Software testing; Statistical analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Mutation Analysis, 2006. Second Workshop on
Conference_Location
Raleigh, NC
Print_ISBN
0-7695-2897-X
Type
conf
DOI
10.1109/MUTATION.2006.7
Filename
4144724
Link To Document