TY - GEN
T1 - Predictive mutation testing
AU - Zhang, Jie
AU - Wang, Ziyi
AU - Zhang, Lingming
AU - Hao, Dan
AU - Zang, Lei
AU - Cheng, Shiyang
AU - Zhang, Lu
N1 - Funding Information:
This work is supported by the National 973 Program of China No.2015CB352201, the National Natural Science Foundation of China under Grants No.61421091, 61225007, 61522201, 61272157, and 61529201. The authors from UT Dallas are supported in part by NSF grant CCF-1566589, UT Dallas start-up fund, and Google Faculty Research Award.
Publisher Copyright:
© 2016 ACM.
PY - 2016/7/18
Y1 - 2016/7/18
N2 - Mutation testing is a powerful methodology for evaluating test suite quality. In mutation testing, a large number of mutants are generated and executed against the test suite to check the ratio of killed mutants. Therefore, mutation testing is widely believed to be a computationally expensive technique. To alleviate the efficiency concern of mutation testing, in this paper, we propose predictive mutation testing (PMT), the first approach to predicting mutation testing results without mutant execution. In particular, the proposed approach constructs a classification model based on a series of features related to mutants and tests, and uses the classification model to predict whether a mutant is killed or survived without executing it. PMT has been evaluated on 163 real-world projects under two application scenarios (i.e., cross-version and cross-project). The experimental results demonstrate that PMT improves the efficiency of mutation testing by up to 151.4X while incurring only a small accuracy loss when predicting mutant execution results, indicating a good tradeoff between efficiency and effectiveness of mutation testing.
AB - Mutation testing is a powerful methodology for evaluating test suite quality. In mutation testing, a large number of mutants are generated and executed against the test suite to check the ratio of killed mutants. Therefore, mutation testing is widely believed to be a computationally expensive technique. To alleviate the efficiency concern of mutation testing, in this paper, we propose predictive mutation testing (PMT), the first approach to predicting mutation testing results without mutant execution. In particular, the proposed approach constructs a classification model based on a series of features related to mutants and tests, and uses the classification model to predict whether a mutant is killed or survived without executing it. PMT has been evaluated on 163 real-world projects under two application scenarios (i.e., cross-version and cross-project). The experimental results demonstrate that PMT improves the efficiency of mutation testing by up to 151.4X while incurring only a small accuracy loss when predicting mutant execution results, indicating a good tradeoff between efficiency and effectiveness of mutation testing.
KW - Machine learning
KW - Mutation testing
KW - Software testing
UR - http://www.scopus.com/inward/record.url?scp=84984865403&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84984865403&partnerID=8YFLogxK
U2 - 10.1145/2931037.2931038
DO - 10.1145/2931037.2931038
M3 - Conference contribution
AN - SCOPUS:84984865403
T3 - ISSTA 2016 - Proceedings of the 25th International Symposium on Software Testing and Analysis
SP - 342
EP - 353
BT - ISSTA 2016 - Proceedings of the 25th International Symposium on Software Testing and Analysis
A2 - Roychoudhury, Abhik
A2 - Zeller, Andreas
PB - Association for Computing Machinery, Inc
T2 - 25th International Symposium on Software Testing and Analysis, ISSTA 2016
Y2 - 18 July 2016 through 20 July 2016
ER -