Finding sufficient mutation operators via variable reduction

Akbar Siami Namin, James H. Andrews

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Scopus citations

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.

Original languageEnglish
Title of host publication2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06
DOIs
StatePublished - Dec 1 2006
Event2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06 - Raleigh, NC, United States
Duration: Nov 7 2006Nov 10 2006

Publication series

Name2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06

Conference

Conference2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06
CountryUnited States
CityRaleigh, NC
Period11/7/0611/10/06

Cite this

Namin, A. S., & Andrews, J. H. (2006). Finding sufficient mutation operators via variable reduction. In 2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06 [4144724] (2nd Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006), MUTATION'06). https://doi.org/10.1109/MUTATION.2006.7