Mutation Testing Repository

Mutation Testing Publications

Search results for "Untch95", found 1 papers, 1 pages

1Roland H. Untch
Schema-based Mutation Analysis: A New Test Data Adequacy Assessment Method
Clemson University, Clemson, South Carolina, 1995.Unknown-
BibTeX | Abstract | URL

Mutation-based software testing, or \em mutation testing, is a powerful testing technique applied primarily at the unit software level. Central to mutation testing is the need to analyze a test set to determine a quality measure called the \em mutation adequacy score\,; this assessment process is called \em mutation analysis. Unfortunately, the conventional method of performing mutation analysis, which requires interpreting many slightly different versions of the same program, has significant problems. Automated mutation analysis systems based on the conventional interpretive method are slow, laborious to build, and usually unable to completely emulate the intended operational environment of the software being tested. This research presents a solution to these problems: the \underlineMutant \underlineSchema \underlineGeneration (MSG) method. Rather than mutating an intermediate form of the program that then must be interpreted, this new method describes how to encode all mutations into one source-level program, a ``metamutant''\@. This program is then compiled (once) with the same compiler used during development and is executed in the same operational environment at compiled-program speeds. Since mutation systems based on mutant schemata do not need to provide run-time semantics and environment, they are significantly less complex and easier to build than interpretive systems, as well as more portable. An approach to automatically generating metamutants using attribute grammars is also presented. An MSG-based prototype mutation analysis system, \tt TUMS, was designed and implemented to demonstrate the automated generation of metamutants and to allow empirical performance studies to be conducted. Benchmarks show \tt TUMS significantly faster than \tt Mothra, a conventional interpretive mutation analysis system, with speed-ups as high as an order-of-magnitude observed. Additional studies are reported that contrast the performance of \tt TUMS to a hypothetical ``ideal'' mutation analysis system. We conclude that high performance mutation analysis is possible through the \mboxcreation and instantiation of mutant schemata and that the MSG method described in this dissertation is a viable and desirable approach for building automated mutation analysis systems.

@PHDTHESIS{Untch95, author = {Roland H. Untch}, title = {Schema-based Mutation Analysis: A New Test Data Adequacy Assessment Method}, school = {Clemson University}, year = {1995}, type = {phdthesis}, address = {Clemson, South Carolina}, month = {December}, }