Functional program testing and analysis
Functional program testing and analysis
Reducing the cost of mutation testing: an empirical study
Journal of Systems and Software
An experimental determination of sufficient mutant operators
ACM Transactions on Software Engineering and Methodology (TOSEM)
An experimental evaluation of selective mutation
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria
ICSE '94 Proceedings of the 16th international conference on Software engineering
Interface Mutation: An Approach for Integration Testing
IEEE Transactions on Software Engineering
Proteum/IM 2.0: An Integrated Mutation Testing Environment
Mutation testing for the new century
Mutation analysis of program test data
Mutation analysis of program test data
Finding Sufficient Mutation Operators via Variable Reduction
MUTATION '06 Proceedings of the Second Workshop on Mutation Analysis
Testing Programs with the Aid of a Compiler
IEEE Transactions on Software Engineering
Sufficient mutation operators for measuring test effectiveness
Proceedings of the 30th international conference on Software engineering
| Hi-index | 0.00 |
Mutation analysis evaluates the quality of a test suite based on its ability to reveal simple faults, termed mutations, injected in the program under test. Unfortunately, the need to execute many slightly different versions, or mutants, of a program makes mutation analysis a computationally expensive technique. This paper reports on a promising approach that reduces the cost of mutation analysis by reducing the number of mutants that need to be executed.