Problems of Mutation Testing and Higher Order Mutation Testing

被引:25
作者
Quang Vu Nguyen [1 ]
Madeyski, Lech [1 ]
机构
[1] Wroclaw Univ Technol, Inst Informat, Wybrzeze Wyspianskiego 27, PL-50370 Wroclaw, Poland
来源
ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING | 2014年 / 282卷
关键词
Mutation Testing; Higher Order Mutation; Higher Order Mutants;
D O I
10.1007/978-3-319-06569-4_12
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Since Mutation Testing was proposed in the 1970s, it has been considered as an effective technique of software testing process for evaluating the quality of the test data. In other words, Mutation Testing is used to evaluate the fault detection capability of the test data by inserting errors into the original program to generate mutations, and after then check whether tests are good enough to detect them. However, the problems of mutation testing such as a large number of generated mutants or the existence of equivalent mutants, are really big barriers for applying mutation testing. A lot of solutions have been proposed to solve that problems. A new form of Mutation Testing, Higher Order Mutation Testing, was first proposed by Harman and Jia in 2009 and is one of the most promising solutions. In this paper, we consider the main limitations of Mutation Testing and previous proposed solutions to solve that problems. This paper also refers to the development of Higher Order Mutation Testing and reviews the methods for finding the good Higher Order Mutants.
引用
收藏
页码:157 / 172
页数:16
相关论文
共 100 条
[1]  
Adamopoulos K, 2004, LECT NOTES COMPUT SC, V3103, P1338
[2]   A systematic review of search-based testing for non-functional system properties [J].
Afzal, Wasif ;
Torkar, Richard ;
Feldt, Robert .
INFORMATION AND SOFTWARE TECHNOLOGY, 2009, 51 (06) :957-976
[3]  
Agrawal H., 1989, Design of mutant operators for the C programming language
[4]  
[Anonymous], 1980, THESIS
[5]  
[Anonymous], 1980, Order No. 8025191
[6]  
[Anonymous], 1988, SERCTR14P PURD U
[7]  
Baldwin D, 1979, 276 YAL U
[8]   Toward the determination of sufficient mutant operators for C [J].
Barbosa, EF ;
Maldonado, JC ;
Vincenzi, AMR .
SOFTWARE TESTING VERIFICATION & RELIABILITY, 2001, 11 (02) :113-136
[9]  
Bogacki B, 2006, INT FED INFO PROC, V227, P273
[10]  
Bogacki B, 2006, LECT NOTES COMPUT SC, V4044, P202