A Fortran language system for mutation-based software testing
Software—Practice & Experience
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Investigations of the software testing coupling effect
ACM Transactions on Software Engineering and Methodology (TOSEM)
Experimental results from an automatic test case generator
ACM Transactions on Software Engineering and Methodology (TOSEM)
Mutation analysis using mutant schemata
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
An experimental evaluation of selective mutation
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Mutation-based software testing using program schemata
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
An Empirical Evaluation of Weak Mutation
IEEE Transactions on Software Engineering
An Experimental Determination of Sufficient Mutation Operators
An Experimental Determination of Sufficient Mutation Operators
Mutation analysis of program test data
Mutation analysis of program test data
A theory of error-based testing
A theory of error-based testing
Weak Mutation Testing and Completeness of Test Sets
IEEE Transactions on Software Engineering
A goal tree based high-level test planning system for DSP real number models
ITC '98 Proceedings of the 1998 IEEE International Test Conference
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
Mutation testing is a technique for unit testing software that, although powerful, is computationally expensive. Recent engineering advances have given us techniques and algorithms for significantly reducing the cost of mutation testing. These techniques include a new algorithmic execution technique called schema-based mutation, an approximation technique called weak mutation, a reduction technique called selective mutation, and algorithms for automatic test data generation. This paper outlines a design for a system that will approximate mutation, but in a way that will be accessible to everyday programmers. We envision a system to which a programmer can submit a program unit, and get back a set of input/output pairs that are guaranteed to form an effective test of the unit by being close to mutation adequate.