ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Efficient mutation testing by checking invariant violations
Full text PdfPdf (568 KB)
Source
International Symposium on Software Testing and Analysis archive
Proceedings of the eighteenth international symposium on Software testing and analysis table of contents
Chicago, IL, USA
SESSION: Empirical studies table of contents
Pages: 69-80  
Year of Publication: 2009
ISBN:978-1-60558-338-9
Authors
David Schuler  Saarland University, Saarbrücken, Germany
Valentin Dallmeier  Saarland University, Saarbrücken, Germany
Andreas Zeller  Saarland University, Saarbrücken, Germany
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 118,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1572272.1572282
What is a DOI?

ABSTRACT

Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a mutation is not detected by the test suite, this usually means that the test suite is not adequate. However, it may also be that the mutant keeps the program's semantics unchanged-and thus cannot be detected by any test. Such equivalent mutants have to be eliminated manually, which is tedious.

We assess the impact of mutations by checking dynamic invariants. In an evaluation of our JAVALANCHE framework on seven industrial-size programs, we found that mutations that violate invariants are significantly more likely to be detectable by a test suite. As a consequence, mutations with impact on invariants should be focused upon when improving test suites. With less than 3% of equivalent mutants, our approach provides an efficient, precise, and fully automatic measure of the adequacy of a test suite.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
K. Adamopoulos, M. Harman, and R. M. Hierons. How to overcome the equivalent mutant problem and achieve tailored selective mutation using co-evolution. In Genetic and Evolutionary Computation - GECCO 2004, volume 3103 of Lecture Notes in Computer Science, pages 1338--1349, Seattle, Washington, 2004. Springer.
2
 
3
D. Baldwin and F. Sayward. Heuristics for determining equivalence of program mutations. Technical Report 276, Yale University, Department of Computer Science, 1979.
 
4
V. Dallmeier, C. Lindig, and A. Zeller. Lightweight defect localization for Java. In ECOOP '05: Proceedings of 19th European Conference on Object-Oriented Programming, number 3586 in Lecture Notes in Computer Science, pages 528--550. Springer, 2005.
 
5
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, pages 142--151, Ban, Alberta, 1988. IEEE Computer Society Press.
 
6
 
7
 
8
 
9
B. J. M. Grün, D. Schuler, and A. Zeller. The impact of equivalent mutants. Technical report, Saarland University, 2009. Short paper submitted to Mutation 2009: International Workshop on Mutation Analysis.
10
 
11
R. Hierons and M. Harman. Using program slicing to assist in the detection of equivalent mutants. Software Testing, Verification and Reliability, 9(4):233--262, 1999.
 
12
 
13
14
15
 
16
17
 
18
A. J. Offutt and W. M. Craft. Using compiler optimiziation techniques to detect equivalent mutants. Software Testing, Verification, and Reliability, 4:131--154, 1994.
19
 
20
A. J. Offutt and J. Pan. Detecting equivalent mutants and the feasible path problem. In COMPASS '96: Proceedings 11th Conference on Computer Assurance, pages 224--236, Gathersburg, MD, 1996.
 
21
A. J. Offutt and R. H. Untch. Mutation 2000: Uniting the orthogonal, pages 34--44. Kluwer Academic Publishers, Norwell, MA, USA, 2001.
 
22
C. Pacheco and M. D. Ernst. Eclat: Automatic generation and classification of test inputs. In ECOOP '05: Procceedings of the 9th European Conference on Object-Oriented Programming, pages 504--527, Glasgow, Scotland, 2005.
23
24
 
25
26
 
27


Collaborative Colleagues:
David Schuler: colleagues
Valentin Dallmeier: colleagues
Andreas Zeller: colleagues