On sufficiency of mutants

Akbar Siami Namin, James H. Andrews

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

11 Scopus citations

Abstract

Mutation is the practice of automatically generating possibly faulty variants of a program, for the purpose of assessing the adequacy of a test suite or comparing testing techniques. The cost of mutation often makes its application infeasible. The cost of mutation is usually assessed in terms of the number of mutants, and consequently the number of "mutation operators" that produce them. We address this problem by finding a smaller subset of mutation operators, called "sufficient", that can model the behaviour of the full set. To do this, we provide an experimental procedure and adapt statistical techniques proposed for variable reduction, model selection and nonlinear regression. Our preliminary results reveal interesting information about mutation operators.

Original languageEnglish
Title of host publicationProceedings - 29th International Conference on Software Engineering, ICSE 2007; Companion Volume
Pages73-74
Number of pages2
DOIs
StatePublished - 2007
Event29th International Conference on Software Engineering, ICSE 2007 - Minneapolis, MN, United States
Duration: May 20 2007May 26 2007

Publication series

NameProceedings - International Conference on Software Engineering
ISSN (Print)0270-5257

Conference

Conference29th International Conference on Software Engineering, ICSE 2007
CountryUnited States
CityMinneapolis, MN
Period05/20/0705/26/07

Fingerprint Dive into the research topics of 'On sufficiency of mutants'. Together they form a unique fingerprint.

  • Cite this

    Namin, A. S., & Andrews, J. H. (2007). On sufficiency of mutants. In Proceedings - 29th International Conference on Software Engineering, ICSE 2007; Companion Volume (pp. 73-74). [4222686] (Proceedings - International Conference on Software Engineering). https://doi.org/10.1109/ICSECOMPANION.2007.56