Using Constraints for Equivalent Mutant Detection

Simona Nica
(Institute for Software Technology, Technische Universität Graz)
Franz Wotawa
(Institute for Software Technology, Technische Universität Graz)

In mutation testing the question whether a mutant is equivalent to its program is important in order to compute the correct mutation score. Unfortunately, answering this question is not always possible and can hardly be obtained just by having a look at the program's structure. In this paper we introduce a method for solving the equivalent mutant problem using a constraint representation of the program and its mutant. In particularly the approach is based on distinguishing test cases, i.e., test inputs that force the program and its mutant to behave in a different way. Beside the foundations of the approach, in this paper we also present the algorithms and first empirical results.

In César Andrés and Luis Llana: Proceedings 2nd Workshop on Formal Methods in the Development of Software (WS-FMDS 2012), Paris, France, August 28, 2012, Electronic Proceedings in Theoretical Computer Science 86, pp. 1–8.
Published: 8th July 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.86.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org