Kernel Density Adaptive Random Testing

被引:0
|
作者
Patrick, Matthew [1 ]
Jia, Yue [2 ]
机构
[1] Univ Cambridge, Cambridge CB2 1TN, England
[2] UCL, CREST, London WC1E 6BT, England
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Mutation analysis is used to assess the effectiveness of a test data generation technique at finding faults. Once a mutant is killed, decisions must be made whether to diversify or intensify the subsequent test inputs. Diversification employs a wide range of test inputs with the aim of increasing the chances of killing new mutants. By contrast, intensification selects test inputs which are similar to those previously shown to be successful, taking advantage of overlaps in the conditions under which mutants can be killed. This paper explores the trade-off between diversification and intensification by augmenting Adaptive Random Testing (ART) to estimate the Kernel Density (KD-ART) of input values which are found to kill mutants. The results suggest that intensification is typically more effective at finding faults than diversification. KD-ART (intensify) achieves 7.24% higher mutation score on average than KD-ART (diversify). Moreover, KD-ART is computationally less expensive than ART. The new technique requires an average 5.98% of the time taken before.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Analysis of kernel density estimation of functions of random variables
    Ahmad, IA
    Mugdadi, AR
    JOURNAL OF NONPARAMETRIC STATISTICS, 2003, 15 (4-5) : 579 - 605
  • [32] Adaptive random testing by bisection with restriction
    Mayer, J
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2005, 3785 : 251 - 263
  • [33] Adaptive random testing by bisection and localization
    Mayer, Johannes
    FORMAL APPROACHES TO SOFTWARE TESTING, 2006, 3997 : 72 - 86
  • [34] Adaptive random testing with CG constraint
    Chan, FT
    Chan, KP
    Chen, TY
    Yiu, SM
    PROCEEDINGS OF THE 28TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATION CONFERENCE, WORKSHOP AND FAST ABSTRACTS, 2004, : 96 - 99
  • [35] Adaptive Random Testing for XSS Vulnerability
    Lv, Chengcheng
    Zhang, Long
    Zeng, Fanping
    Zhang, Jian
    2019 26TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC), 2019, : 63 - 69
  • [36] Code Coverage of Adaptive Random Testing
    Chen, Tsong Yueh
    Kuo, Fei-Ching
    Liu, Huai
    Wong, W. Eric
    IEEE TRANSACTIONS ON RELIABILITY, 2013, 62 (01) : 226 - 237
  • [37] On favourable conditions for adaptive random testing
    Chen, Tsong Yueh
    Kuo, Fei-Ching
    Zhou, Zhi Quan
    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2007, 17 (06) : 805 - 825
  • [38] Adaptive and Random Partition Software Testing
    Lv, Junpeng
    Hu, Hai
    Cai, Kai-Yuan
    Chen, Tsong Yueh
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2014, 44 (12): : 1649 - 1664
  • [39] Fast adaptive kernel density estimator for data streams
    Boedihardjo, Arnold P.
    Lu, Chang-Tien
    Chen, Feng
    KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 42 (02) : 285 - 317
  • [40] Adaptive optimal kernel density estimation for directional data
    Thanh Mai Pham Ngoc
    JOURNAL OF MULTIVARIATE ANALYSIS, 2019, 173 : 248 - 267