Towards automating the generation of mutation tests
Proceedings of the 5th Workshop on Automation of Software Test
Strong higher order mutation-based test data generation
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Journal of Systems and Software
Reduction of test suites using mutation
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Selecting mutation operators with a multiobjective approach
Expert Systems with Applications: An International Journal
Linking software testing results with a machine learning approach
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Although powerful, mutation is a computationally very expensive testing technique. In fact, its three main stages (mutant generation, mutant execution and result analysis) require many resources to be successfully accomplished. Thus, researchers have made important efforts to reduce its costs. This paper represents an additional effort in this sense. It describes the results of two experiments in which, by means of combining the original set of mutants and therefore obtaining a new set of mutants—each one with two faults—the number of mutants used is reduced to half. Results lead to believe that mutant combination does not decrease the quality of the test suite, whereas it supposes important savings in mutant execution and result analysis. Copyright © 2008 John Wiley & Sons, Ltd.