Learning‐based mutant reduction using fine‐grained mutation operators

Summary For mutation testing, the huge cost of running test suites on a large number of mutants has been a serious obstacle. To resolve this problem, we propose a learning‐based mutant reduction technique MuTrain. MuTrain uses cost‐considerate linear regression (i.e., CLARS) to learn a mutation mode...

Full description

Saved in:
Bibliographic Details
Published in:Software testing, verification & reliability verification & reliability, 2022-11, Vol.32 (7), p.n/a
Main Authors: Kim, Yunho, Hong, Shin
Format: Article
Language:English
Subjects:
cost‐considerate linear regression
Learning
mutant reduction
Mutation
mutation analysis
mutation operator
mutation score prediction
Operators
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary For mutation testing, the huge cost of running test suites on a large number of mutants has been a serious obstacle. To resolve this problem, we propose a learning‐based mutant reduction technique MuTrain. MuTrain uses cost‐considerate linear regression (i.e., CLARS) to learn a mutation model, which predicts the mutation score of a test suite based on the mutation testing results of a previous version of a target program. Then, MuTrain applies the mutation model for subsequent versions to predict mutation scores with significantly fewer mutants. For effective mutant reduction and accurate mutation score prediction, MuTrain uses fine‐grained mutation operators refined from the existing coarse‐grained mutation operators. The experiment results show that MuTrain reduces the number of mutants effectively (i.e., selecting only 1.6% of mutants). Moreover, MuTrain predicts mutation score far more accurately than the existing mutant reduction techniques and random mutant selection. We also found that MuTrain achieves much greater mutant reduction when it uses the fine‐grained mutation operators than the traditional coarse‐grained mutation operators (i.e., 1.6% vs. 14.6%). We propose a learning‐based mutant reduction technique MuTrain. MuTrain first learns a mutation model to predict the mutation score of a test suite based on the mutation testing results of a previous version of a target program and then applies the mutation model for subsequent versions to predict mutation scores with significantly fewer mutants. For effective mutant reduction and accurate mutation score prediction, MuTrain uses fine‐grained mutation operators refined from the existing coarse‐grained mutation operators.
ISSN:0960-0833
1099-1689
DOI:10.1002/stvr.1786