2011
DOI: 10.1016/j.infsof.2011.03.007
|View full text |Cite
|
Sign up to set email alerts
|

A mutation carol: Past, present and future

Abstract: Context: The field of mutation analysis has been growing, both in the number of published papers and the number of active researchers. This special issue provides a sampling of recent advances and ideas. But do all the new researchers know where we started? Objective: To imagine where we are going, we must first know where we are. To understand where we are, we must know where we have been. This paper reviews past mutation analysis research, considers the present, then imagines possible future directions. Meth… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
88
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(95 citation statements)
references
References 85 publications
1
88
0
Order By: Relevance
“…To overcome the equivalent mutant problem, there are mainly 3 categories classified by Madeyski et al [6]: (1) detecting equivalent mutants, such as Baldwin and Sayward [38] (using compiler optimisations), Hierons et al [39] (using program slicing), Martin and Xie [40] (through change-impact analysis), Ellims et al [41] (using running profile), and du Bousquet and Delaunay [42] (using model checker); (2) avoiding equivalent mutant generation, such as Mresa and Bottaci [31] (through selective mutation), Harman et al [43] (using program dependence analysis), and Adamopoulos et al [44] (using co-evolutionary search algorithm); (3) suggesting equivalent mutants, such as Bayesian learning [45], dynamic invariants analysis [46], and coverage change examination (eg [47]).…”
Section: Benefits and Limitationsmentioning
confidence: 99%
“…To overcome the equivalent mutant problem, there are mainly 3 categories classified by Madeyski et al [6]: (1) detecting equivalent mutants, such as Baldwin and Sayward [38] (using compiler optimisations), Hierons et al [39] (using program slicing), Martin and Xie [40] (through change-impact analysis), Ellims et al [41] (using running profile), and du Bousquet and Delaunay [42] (using model checker); (2) avoiding equivalent mutant generation, such as Mresa and Bottaci [31] (through selective mutation), Harman et al [43] (using program dependence analysis), and Adamopoulos et al [44] (using co-evolutionary search algorithm); (3) suggesting equivalent mutants, such as Bayesian learning [45], dynamic invariants analysis [46], and coverage change examination (eg [47]).…”
Section: Benefits and Limitationsmentioning
confidence: 99%
“…To minimise the random error, we carry out the process of the mutant selection 100 times for each project, and compare the error rate, i.e. the ratio of mistakenly predicated mutants in strong mutation, as shown in Equation 1. For this experiment, we used all test cases.…”
Section: B Experimental Setupmentioning
confidence: 99%
“…Mutation testing introduces small syntactic changes into the program to generate faulty versions (mutants) according to well-defined rules (mutation operators) [1]. Then the quality of a test suite can be qualified as the percentage of mutants it distinguishes from the original program (mutation score).…”
Section: Introductionmentioning
confidence: 99%
“…Over the years, mutation testing has been remarkably studied and applied not only to programs from different programming paradigms such as Fortran programs [19,20], C programs [21], Java programs [22], and AspectJ programs [12,23], but also to specifications or models of programs, such as Finite State Machine [24], Petri Nets [25], and Security Policies [26]. Surveys and reviews on work in mutation testing can be found in [27][28][29].…”
Section: Mutation Testing (Traditional)mentioning
confidence: 99%