.png){kind=icon}
.png){kind=icon}
Return
Efficient multi-objective higher order mutation testing with genetic programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2010.07.027.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is said 90% of faults that survive manufacturer's testing procedures are complex. That is, the corresponding bug fix contains multiple changes. Higher order mutation testing is used to study defect interactions and their impact on software testing for fault finding. We adopt a multi-objective Pareto optimal approach using Monte Carlo sampling, genetic algorithms and genetic programming to search for higher order mutants which are both hard-to-kill and realistic. The space of complex faults (higher order mutants) is much larger than that of traditional first order mutations which correspond to simple faults, nevertheless search based approaches make this scalable. The problems of non-determinism and efficiency are overcome. Easy to detect faults may become harder to detect when they interact and impossible to detect single faults may be brought to light when code contains two such faults. We use strong typing and BNF grammars in search based mutation testing to find examples of both in ancient heavily optimised every day C code. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Pareto optimality
Mutation testing
Higher order mutation
SBSE
Monte Carlo
Genetic algorithm
Genetic programming
NSGA-II
Strongly typed GP
Grammar based GP
Non-determinism
Triangle
Schedule
tcas
Gzip
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K