arrow
Return

Boundary sampling to boost mutation testing for deep learning models

delete2021-02-01
delete16
PRE
AI
W
Weijun Shen
Y
Yanhui Li *
Y
Yuanlei Han
L
Lin Chen
D
Di Wu
B
Baowen Xu
DOI:10.1016/j.infsof.2020.106413delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Context: The prevalent application of Deep Learning (DL) models has raised concerns about their reliability. Due to the data-driven programming paradigm, the quality of test datasets is extremely important to gain accurate assessment of DL models. Recently, researchers have introduced mutation testing into DL testing, which applies mutation operators to generate mutants from DL models, and observes whether the test data can identify mutants to check the quality of test dataset. However, there still exist many factors (e.g., huge labeling efforts and high running cost) hindering the implementation of mutation testing for DL models. Objective: We desire for an approach to selecting a smaller, sensitive, representative and efficient subset of the whole test dataset to promote the current mutation testing (e.g., reduce labeling and running cost) for DL Models. Method: We propose boundary sample selection (BSS), which employs the distance of samples to decision boundary of DL models as the indicator to construct the appropriate subset. To evaluate the performance of BSS, we conduct an extensive empirical study with two widely-used datasets, three popular DL models, and 14 up-to-date DL mutation operators. Results : We observe that (1) The sizes of our subsets generated by BSS are much smaller (about 3%-20% of the whole test set). (2) Under most mutation operators, our subsets are superior (about 9.94-21.63) than the whole test sets in observing mutation effects. (3) Our subsets could replace the whole test sets to a very high degree (higher than 97%) when considering mutation score. (4) The MRR values of our proposed subsets are clearly better (about 2.28-13.19 times higher) than that of the whole test sets. Conclusions: The result shows that BSS can help testers save labelling cost, run mutation testing quickly and identify killed mutants early.
Keywords:
Software testing
Deep learning
Mutation testing
Boundary
Neural network
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Information and Software Technology cover
Information and Software Technology
IF:
4.3
Papers:
3.8K
Citations:
7.7K

Organization

N
nanjing university
Scholars:
7.8W
Papers: 5.6W
Citations: 87
Cited Papers

Cited Papers

On the use of usage patterns from telemetry data for test case prioritization
err2019-09-01
err10
PREAI
errAnderson, Jeff; Azizi, Maral; Salem, Saeed; Do, Hyunsook
errShare
errSave
Boundary detection and sample reduction for one-class Support Vector Machines
err2014-01-01
err59
PREAI
errZhu, Fa; Ye, Ning; Yu, Wei; Xu, Sheng; Li, Guobao
errShare
errSave
A novel use of equivalent mutants for static anomaly detection in software artifacts
err2017-01-01
err10
errOAAI
errArcaini, Paolo; Gargantini, Angelo; Riccobene, Elvinia; Vavassori, Paolo
errShare
errSave
A path-aware approach to mutant reduction in mutation testing
err2017-01-01
err31
errOAAI
errSun, Chang-ai; Xue, Feifei; Liu, Huai; Zhang, Xiangyu
errShare
errSave
MUSEUM: Debugging real-world multilingual programs using mutation analysis
err2017-02-01
err28
errOAAI
errHong, Shin; Kwak, Taehoon; Lee, Byeongcheol; Jeon, Yiru; Ko, Bongseok; Kim, Yunho; Kim, Moonzoo
errShare
errSave
researcher View more