DocumentCode
2075258
Title
Is operator-based mutant selection superior to random mutant selection?
Author
Zhang, Lu ; Hou, Shan-Shan ; Hu, Jun-Jue ; Xie, Tao ; Mei, Hong
Author_Institution
Inst. of Software, Peking Univ., Beijing, China
Volume
1
fYear
2010
fDate
2-8 May 2010
Firstpage
435
Lastpage
444
Abstract
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutants in mutation testing and analysis. Most existing research on mutant selection focused on operator-based mutant selection, i.e., determining a set of sufficient mutation operators and selecting mutants generated with only this set of mutation operators. Recently, researchers began to leverage statistical analysis to determine sufficient mutation operators using execution information of mutants. However, whether mutants selected with these sophisticated techniques are superior to randomly selected mutants remains an open question. In this paper, we empirically investigate this open question by comparing three representative operator-based mutant-selection techniques with two random techniques. Our empirical results show that operator-based mutant selection is not superior to random mutant selection. These results also indicate that random mutant selection can be a better choice and mutant selection on the basis of individual mutants is worthy of further investigation.
Keywords
program testing; statistical analysis; mutation testing; operator-based mutant selection; random mutant selection; software testing; statistical analysis; Educational institutions; Measurement; Schedules; Software; Software testing; Stability analysis; mutation testing; test-adequacy criterion;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, 2010 ACM/IEEE 32nd International Conference on
Conference_Location
Cape Town
ISSN
0270-5257
Print_ISBN
978-1-60558-719-6
Type
conf
DOI
10.1145/1806799.1806863
Filename
6062111
Link To Document