Journal Article10.1145/1022494.1022537
An experimental mutation system for Java
118
TL;DR: This paper presents a publicly available mutation system for Java that supports both traditional statement-level mutants and newer inter-class mutants, and hopes that it will promote the use of mutation analysis for experimental research in software testing.
read more
Abstract: Mutation is a powerful but complicated and computationally expensive testing method. Mutation is also a valuable experimental research technique that has been used in many studies. Mutation has been experimentally compared with other test criteria, and also used to support experimental comparisons of other test criteria, by using mutants as a method to create faults. In effect, mutation is often used as a "gold standard" for experimental evaluations of test methods. This paper presents a publicly available mutation system for Java that supports both traditional statement-level mutants and newer inter-class mutants. MUJAVA can be freely downloaded and installed with relative ease under both Unix and Windows. MUJAVA is offered as a free service to the community and we hope that it will promote the use of mutation analysis for experimental research in software testing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Analysis and Survey of the Development of Mutation Testing
Yue Jia,Mark Harman +1 more
TL;DR: These analyses provide evidence that Mutation Testing techniques and tools are reaching a state of maturity and applicability, while the topic of Mutation testing itself is the subject of increasing interest.
1.8K
Mutation Testing Advances: An Analysis and Survey
Mike Papadakis,Marinos Kintis,Jie Zhang,Yue Jia,Yves Le Traon,Mark Harman +5 more
- 01 Jan 2019
TL;DR: This chapter presents a survey of recent advances, over the past decade, related to the fundamental problems of mutation testing and sets out the challenges and open problems for the future development of the method.
Higher Order Mutation Testing
Yue Jia,Mark Harman +1 more
- 01 Oct 2009
TL;DR: The paper introduces the concept of a subsuming HOM; one that is harder to kill than the first order mutants from which it is constructed, by definition, subsumed HOMs denote subtle fault combinations.
Testing services and service-centric systems: challenges and opportunities
Gerardo Canfora,M. Di Penta +1 more
TL;DR: This paper provides users and system integrators with an overview of service-oriented architecture testing's fundamental technical issues and solutions, focusing on Web services as a practical implementation of the SOA model.
237
•Dissertation
Higher Order Mutation Testing
Yue Jia
- 28 Aug 2013
TL;DR: In this paper, the authors proposed a higher order mutation testing paradigm which combines valuable higher order mutants and non-trivial first order mutants together for mutation testing, and proposed a search process that seeks fit mutants (both first and higher order) from the space of all possible mutants.
181
References
Hints on Test Data Selection: Help for the Practicing Programmer
TL;DR: In many cases tests of a program that uncover simple errors are also effective in uncovering much more complex errors, so-called coupling effect can be used to save work during the testing process.
2.2K
Constraint-based automatic test data generation
R.A. DeMilli,A.J. Offutt +1 more
TL;DR: Godzilla is a fault-based technique that uses algebraic constraints to describe test cases designed to find particular types of faults and has been integrated with the Mothra testing system.
884
An experimental determination of sufficient mutant operators
TL;DR: The results support the hypothesis that selective mutation is almost as strong as nonselective mutation: in experimental trials selective mutation provides almost the same coverage as non selective mutation.
740
Testing Programs with the Aid of a Compiler
TL;DR: Finite input-output specifications are added to the syntax of programs so that they exercise the control and expression structure of a program as well as any tests can and can be verified at compile time.
603