Beatriz Souza
ABSTRACT
One recent promising direction in reducing costs of mutation analysis is to identify redundant mutations. We propose a technique to discover redundant mutations by proving subsumption relations among method-level mutation operators using weak mutation testing. We conceive and encode a theory of subsumption relations in Z3 for 40 mutation targets (mutations of an expression or statement). Then we prove a number of subsumption relations using the Z3 theorem prover, and reduce the number of mutations in a number of mutation targets. MuJava-M includes some subsumption relations in MuJava. We apply MuJava and MuJava-M to 187 classes of 17 projects. Our approach correctly discards mutations in 74.97% of the cases, and reduces the number of mutations by 72.52%.
- Paul Ammann, Marcio Eduardo Delamaro, and Jeff Offutt. 2014. Establishing theoretical minimal sets of mutants. In ICST (Cleveland, OH, USA). IEEE, Piscataway, NJ, USA, 21--30.Google Scholar
- Artifacts. 2020. https://colab.research.google.com/drive/1kldmXBGgJIOEpCCr6o9cm3P0Jnz7mMix?usp=sharing. (2020).Google Scholar
- Leonardo Mendonça de Moura and Nikolaj Bjørner. 2008. Z3: An Efficient SMT Solver. In TACAS (Budapest, Hungary). Springer, Berlin, Germany, 337--340.Google Scholar
- Richard A DeMillo, Richard J Lipton, and Frederick G Sayward. 1978. Hints on test data selection: Help for the practicing programmer. Computer 11, 4 (1978), 34--41.Google ScholarDigital Library
- Gordon Fraser and Andrea Arcuri. 2011. EvoSuite: automatic test suite generation for object-oriented software. In FSE (Szeged, Hungary). ACM, New York, NY, USA, 416--419.Google Scholar
- Rahul Gopinath, Iftekhar Ahmed, Mohammad Alipour, Carlos Jensen, and Alex Groce. 2017. Mutation Reduction Strategies Considered Harmful. IEEE TR 66 (2017), 854--874. Issue 3.Google Scholar
- Marcio Guimarães, Leo Fernandes, Márcio Ribeiro, Marcelo d'Amorim, and Rohit Gheyi. 2020. Optimizing Mutation Testing by Discovering Dynamic Mutant Subsumption Relations. In ICST (Porto, Portugal). IEEE, Piscataway, NJ, USA, To appear.Google Scholar
- William Howden. 1982. Weak Mutation Testing and Completeness of Test Sets. TSE 8, 4 (1982), 371--379.Google ScholarDigital Library
- Y. Jia and M. Harman. 2009. Higher Order Mutation Testing. IST 51, 10 (2009), 1379 -- 1393.Google Scholar
- René Just, Gregory M Kapfhammer, and Franz Schweiggert. 2012. Do redundant mutants affect the effectiveness and efficiency of mutation analysis?. In ICST (Montreal, QC, Canada). IEEE, Piscataway, NJ, USA, 720--725.Google Scholar
- Gary Kaminski, Paul Ammann, and Jeff Offutt. 2011. Better predicate testing. In AST (Waikiki, Honolulu, HI, USA). ACM, New York, NY, USA, 57--63.Google Scholar
- Marinos Kintis, Mike Papadakis, and Nicos Malevris. 2010. Evaluating mutation testing alternatives: A collateral experiment. In APSEC (Sydney, NSW, Australia). IEEE, Piscataway, NJ, USA, 300--309.Google Scholar
- Birgitta Lindström and András Márki. 2019. On strong mutation and the theory of subsuming logic-based mutants. STVR 29, 1--2 (2019), e1667.Google Scholar
- Yu-Seung Ma, Jeff Offutt, and Yong-Rae Kwon. 2005. MuJava: an automated class mutation system. STVR 15, 2 (2005), 97--133.Google Scholar
- M. Marcozzi, S. Bardin, N. Kosmatov, M. Papadakis, V. Prevosto, and L. Correnson. 2018. Time to Clean Your Test Objectives. In ICSE. ACM, Gothenburg, Sweden, 456--467.Google Scholar
- A. Jefferson Offutt and Stephen D. Lee. 1994. An empirical evaluation of weak mutation. TSE 20, 5 (1994), 337--344.Google Scholar
- Jeff Offutt. 2011. A mutation carol: Past, present and future. IST 53, 10 (2011), 1098 -- 1107.Google Scholar
- Carlos Pacheco, Shuvendu Lahiri, Michael Ernst, and Thomas Ball. 2007. Feedback-Directed Random Test Generation. In ICSE (Minneapolis, MN, USA). IEEE, Piscataway, NJ, USA, 75--84.Google Scholar
- Mike Papadakis, Christopher Henard, Mark Harman, Yue Jia, and Yves Le Traon. 2016. Threats to the Validity of Mutation-based Test Assessment. In ISSTA (Saarbrücken, Germany). ACM, New York, NY, USA, 354--365.Google Scholar
- Mike Papadakis, Marinos Kintis, Jie Zhang, Yue Jia, Yves Le Traon, and Mark Harman. 2019. Chap. six - Mutation Testing Advances: An Analysis and Survey. ADV COMPUT 112 (2019), 275--378.Google ScholarCross Ref
- Mike Papadakis and Nicos Malevris. 2010. An empirical evaluation of the first and second order mutation testing strategies. In ICST (Paris, France). IEEE, Piscataway, NJ, USA, 90--99.Google Scholar
- Dominik Winterer, Chengyu Zhang, and Zhendong Su. 2020. Validating SMT Solvers via Semantic Fusion. In PLDI (London, UK). ACM, New York, NY, USA, 718--730.Google Scholar
- Identifying mutation subsumption relations
Recommendations
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Constrained differential evolution with multiobjective sorting mutation operators for constrained optimization
The proposed constrained differential evolution framework uses nondominated sorting mutation operator based on fitness and diversity information for constrained optimization. This study proposes a new constraint differential evolution framework.Parents ...
A single-point mutation evolutionary programming
In this paper, we propose an improved evolutionary programming based on single-point mutation, which is named Single-Point Mutation Evolutionary Programming (SPMEP). The distinctions between SPMEP and the classical evolutionary programming (EP) are the ...
Comments