Avoiding Useless Mutants

被引:20
作者
Fernandes, Leonardo [1 ]
Ribeiro, Marcio [2 ]
Carvalho, Luiz [2 ]
Gheyi, Rohit [3 ]
Mongiovi, Melina [3 ]
Santos, Andre [1 ]
Cavalcanti, Ana [4 ]
Ferrari, Fabiano [5 ]
Maldonado, Jose Carlos [6 ]
机构
[1] Univ Fed Pernambuco, Informat Ctr, Recife, PE, Brazil
[2] Univ Fed Alagoas, Comp Inst, Maceio, Brazil
[3] Univ Fed Campina Grande, DSC, Campina Grande, Brazil
[4] Univ York, DCS, York, N Yorkshire, England
[5] Univ Fed Sao Carlos, Comp Dept, Sao Carlos, SP, Brazil
[6] Univ Sao Paulo, ICMC, Sao Paulo, Brazil
来源
PROCEEDINGS OF THE 16TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON GENERATIVE PROGRAMMING: CONCEPTS AND EXPERIENCES (GPCE'17) | 2017年
基金
英国工程与自然科学研究理事会;
关键词
Mutation Testing; Equivalent Mutants; Duplicated Mutants; Program Transformation; Code Generation;
D O I
10.1145/3136040.3136053
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Mutation testing is a program-transformation technique that injects artificial bugs to check whether the existing test suite can detect them. However, the costs of using mutation testing are usually high, hindering its use in industry. Useless mutants (equivalent and duplicated) contribute to increase costs. Previous research has focused mainly on detecting useless mutants only after they are generated and compiled. In this paper, we introduce a strategy to help developers with deriving rules to avoid the generation of useless mutants. To use our strategy, we pass as input a set of programs. For each program, we also need a passing test suite and a set of mutants. As output, our strategy yields a set of useless mutants candidates. After manually confirming that the mutants classified by our strategy as "useless" are indeed useless, we derive rules that can avoid their generation and thus decrease costs. To the best of our knowledge, we introduce 37 new rules that can avoid useless mutants right before their generation. We then implement a subset of these rules in the MUJAVA mutation testing tool. Since our rules have been derived based on artificial and small Java programs, we take our MUJAVA version embedded with our rules and execute it in industrial-scale projects. Our rules reduced the number of mutants by almost 13% on average. Our results are promising because (i) we avoid useless mutants generation; (ii) our strategy can help with identifying more rules in case we set it to use more complex Java programs; and (iii) our MUJAVA version has only a subset of the rules we derived.
引用
收藏
页码:187 / 198
页数:12
相关论文
共 37 条
[1]  
Adamopoulos K, 2004, LECT NOTES COMPUT SC, V3103, P1338
[2]  
[Anonymous], 2017, PITEST MUTATION TEST
[3]  
[Anonymous], 1980, THESIS
[4]  
Artho Cyrille, 2016, 2016 IEEE 23rd International Conference on Software Analysis, Evolution and Reengineering (SANER), P29, DOI 10.1109/SANER.2016.32
[5]  
Baldwin Douglas, 1979, TECHNICAL REPORT
[6]   2 NOTIONS OF CORRECTNESS AND THEIR RELATION TO TESTING [J].
BUDD, TA ;
ANGLUIN, D .
ACTA INFORMATICA, 1982, 18 (01) :31-45
[7]   HINTS ON TEST DATA SELECTION - HELP FOR PRACTICING PROGRAMMER [J].
DEMILLO, RA ;
LIPTON, RJ .
COMPUTER, 1978, 11 (04) :34-41
[8]  
Fraser G., 2011, P 19 ACM SIGSOFT S 1, P416
[9]   The Impact of Equivalent Mutants [J].
Gruen, Bernhard J. M. ;
Schuler, David ;
Zeller, Andreas .
ICSTW 2009: IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION, AND VALIDATION WORKSHOPS, 2009, :192-199
[10]  
Hierons R.M., 1999, J SOFTW TEST VERIFIC, V9, P233, DOI 10.1002/(SICI)1099-1689(199912)9:43.0.CO