Finding Sufficient Mutation Operators via Variable Reduction

Authors:
Akbar Siami Namin;James H. Andrews
Affiliations:
University of Western Ontario;University of Western Ontario
Venue:
MUTATION '06 Proceedings of the Second Workshop on Mutation Analysis
Year:
2006

Citing 0
Cited 5

On Sufficiency of Mutants

ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
Sufficient mutation operators for measuring test effectiveness

Proceedings of the 30th international conference on Software engineering
On guiding the augmentation of an automated test suite via mutation analysis

Empirical Software Engineering
On reduced neighborhood mutation analysis using a single mutagenic operator

Proceedings of the 47th Annual Southeast Regional Conference
Semantic mutation testing

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of mutation operators is "sufficient" if it can be used for most purposes to replace a larger set. We describe in detail an experimental procedure for determining a set of sufficient C language mutation operators. We also describe several statistical analyses that determine sufficient subsets with respect to several different criteria, based on standard techniques for variable reduction. We have begun to carry out our experimental procedure on seven standard C subject programs. We present preliminary results that indicate that the procedure and analyses are feasible and yield useful information.