Patrick, M;
Jia, Y;
(2017)
KD-ART: Should we intensify or diversify tests to kill mutants?
Information and Software Technology
, 81
pp. 36-51.
10.1016/j.infsof.2016.04.009.
Preview |
Text
Jia_KDT_Extension__IST_.pdf - Accepted Version Download (941kB) | Preview |
Abstract
CONTEXT: Adaptive Random Testing (ART) spreads test cases evenly over the input domain. Yet once a fault is found, decisions must be made to diversify or intensify subsequent inputs. Diversification employs a wide range of tests to increase the chances of finding new faults. Intensification selects test inputs similar to those previously shown to be successful. OBJECTIVE: Explore the trade-off between diversification and intensification to kill mutants. METHOD: We augment Adaptive Random Testing (ART) to estimate the Kernel Density (KD–ART) of input values found to kill mutants. KD–ART was first proposed at the 10th International Workshop on Mutation Analysis. We now extend this work to handle real world non numeric applications. Specifically we incorporate a technique to support programs with input parameters that have composite data types (such as arrays and structs). RESULTS: Intensification is the most effective strategy for the numerical programs (it achieves 8.5% higher mutation score than ART). By contrast, diversification seems more effective for programs with composite inputs. KD–ART kills mutants 15.4 times faster than ART. CONCLUSION: Intensify tests for numerical types, but diversify them for composite types.
Type: | Article |
---|---|
Title: | KD-ART: Should we intensify or diversify tests to kill mutants? |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1016/j.infsof.2016.04.009 |
Publisher version: | https://doi.org/10.1016/j.infsof.2016.04.009 |
Language: | English |
Keywords: | Science & Technology, Technology, Computer Science, Information Systems, Computer Science, Software Engineering, Computer Science, Mutation Analysis, Adaptive Random Testing, Intensification And Diversification, Density-Function, Generation, Strategy |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1503038 |
Archive Staff Only
![]() |
View Item |