I. M. M. Duncan
Abstract
Mutation Analysis is an established technique for test data generation and source code testing. Developed systems have concentrated on applying some or all of the possible mutant operators (perturbations) to the submitted code. Recent work tackled the scheduling of mutant program execution on vector processors or a Hypercube as a cost reduction scheme. This paper discusses a logical mechanism of impact driven testing in order to acheive full mutation testing with reduced overheads regardless of implementation. Guiding the mutant generation by block impact together with mutant operator heirarchies and a test data coverage scheme enable an efficient tool to be constructed.
- [1] A. T. Acree, T. A. Budd, R. A. DeMillo, R. J. Lipton, and F. G. Sayward. Mutation Analysis . Technical Report GIT-ICS-79/08, School of Information and Computer Science, Georgia Institute of Technology, Atlanta GA, September 1979.Google Scholar
Cross Ref
- [2] A. T. Acree. On Mutation. PhD thesis, Georgia Institute of Technology, Atlanta GA, 1980. Google ScholarDigital Library
- [3] T. A. Budd. Mutation Analysis of Program Test Data. PhD thesis, Yale University, New Haven CT, 1980. Google ScholarDigital Library
- [4] T. A. Budd, R. A. DeMillo, R. J. Lipton, and F. G. Sayward. The design of a prototype mutation system for program testing. In Proceedings NCC, AFIPS Conference Record, pages 623- 627, 1978.Google Scholar
- [5] T. Budd and F. Sayward. Users Guide to the Pilot Mutation System. Technical Report 114. Department of Computer Science, Yale University, 1977.Google Scholar
- [6] R. A. DeMillo, D. S. Guindi, K. N. King, W. M. McCracken, and A. J. Offutt. An extended overview of the Mothra software testing environment. In Proceedings of the Second Workshop on Software Testing, Verification and Analysis, IEEE Computer Society Press, Banff Alberta. July 1988.Google ScholarCross Ref
- [7] W. F. Appelbe, R. A. DeMillo, D. S. Guindi, K. N. King, and W. M. McCracken. Using Mutation Analysis for testing ADA programs. Technical Report SERC-TR-9-P, Purdue University, West Lafayette, Indiana 47907, 1989.Google Scholar
- [8] H. Agarwal, R. DeMillo, R. Hathaway, Wm. Hsu, W Hsu, E. Krauser, R. J. Martin, A. Mathur, and E. Spafford. Design of Mutant Operators for the C Programming Language. Technical Report SERC-TR-41-P, Purdue University, West Lafayette, Indiana, March 1989.Google Scholar
- [9] R. A. DeMillo, R. J. Lipton, and F. G. Sayward. Hints on test data selection: help for the practicing programmer. Computer, 11(4), April 1978.Google Scholar
- [10] J. Hartmann and D. J. Robson. Revalidation during the software maintenance phase. In Proceedings of the Conference on Software Maintenance, IEEE Computer Society Press, October 1989.Google ScholarCross Ref
Index Terms
- Ordered mutation testing
Recommendations
Regression mutation testing
ISSTA 2012: Proceedings of the 2012 International Symposium on Software Testing and AnalysisMutation testing is one of the most powerful approaches for evaluating quality of test suites. However, mutation testing is also one of the most expensive testing approaches. This paper presents Regression Mutation Testing (ReMT), a new technique to ...
Predictive mutation testing
ISSTA 2016: Proceedings of the 25th International Symposium on Software Testing and AnalysisMutation testing is a powerful methodology for evaluating test suite quality. In mutation testing, a large number of mutants are generated and executed against the test suite to check the ratio of killed mutants. Therefore, mutation testing is widely ...
Faster mutation testing inspired by test prioritization and reduction
ISSTA 2013: Proceedings of the 2013 International Symposium on Software Testing and AnalysisMutation testing is a well-known but costly approach for determining test adequacy. The central idea behind the approach is to generate mutants, which are small syntactic transformations of the program under test, and then to measure for a given test ...
Comments