2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW) (2016)
Chicago, IL, USA
April 11, 2016 to April 15, 2016
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSTW.2016.45
Redundancy in mutants, where multiple mutants end up producing the same semantic variant of a program, is a major problem in mutation analysis. Hence, a measure of effectiveness that accounts for redundancy is an essential tool for evaluating mutation tools, new operators, and reduction techniques. Previous research suggests using the size of the disjoint mutant set as an effectiveness measure. We start from a simple premise: test suites need to be judged on both the number of unique variations in specifications they detect (as a variation measure), and also on how good they are at detecting hard-to-find faults (as a measure of thoroughness). Hence, any set of mutants should be judged by how well it supports these measurements. We show that the disjoint mutant set has two major inadequacies -- the single variant assumption and the large test suite assumption -- when used as a measure of effectiveness in variation. These stem from its reliance on minimal test suites. We show that when used to emulate hard to find bugs (as a measure of thoroughness), disjoint mutant set discards useful mutants. We propose two alternatives: one measures variation and is not vulnerable to either the single variant assumption or the large test suite assumption, the other measures thoroughness. We provide a benchmark of these measures using diverse tools.
Size measurement, Conferences, Software testing, Redundancy, Computer bugs, Runtime, Software measurement
R. Gopinath, A. Alipour, I. Ahmed, C. Jensen and A. Groce, "Measuring Effectiveness of Mutant Sets," 2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), Chicago, IL, USA, 2016, pp. 132-141.