Skip to main content
Article thumbnail
Location of Repository

Finding sufficient mutation operators via variable reduction

By Akbar Siami Namin and James H. Andrews

Abstract

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. I

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.3682
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.