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
Software testing, i.e., discovering software failures through test case execution, plays a crucial role in the software development process. A high quality software must have a strong test suite. Therefore it is of high importance for a software to evaluate the test suite that is asserting its correctness. Mutation testing is one efficient method to evaluate the process of software testing, i.e., the quality of the test suite.The current research focuses on mutation testing as a metric that can be used not only for establishing a reliable testing process, but also for improving the test case generation process, when the quality of the test suite is proven to be unsatisfactory. More over we aim to come with a solution to the equivalent mutant problem, by combing mutation testing and constraint systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.