ATM: Black-box Test Case Minimization based on Test Code Similarity and Evolutionary Search

被引:9
|
作者
Pan, Rongqi [1 ]
Ghaleb, Taher A. [1 ]
Briand, Lionel [1 ,2 ]
机构
[1] Univ Ottawa, Sch EECS, Ottawa, ON, Canada
[2] Univ Luxembourg, SnT Ctr, Luxembourg, Luxembourg
基金
加拿大自然科学与工程研究理事会;
关键词
Test case minimization; Test suite reduction; Tree-based similarity; AST; Genetic algorithm; Black-box testing; GENETIC ALGORITHM; PRIORITIZATION; SELECTION;
D O I
10.1109/ICSE48619.2023.00146
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Executing large test suites is time and resource consuming, sometimes impossible, and such test suites typically contain many redundant test cases. Hence, test case (suite) minimization is used to remove redundant test cases that are unlikely to detect new faults. However, most test case minimization techniques rely on code coverage (white-box), model-based features, or requirements specifications, which are not always (entirely) accessible by test engineers. Code coverage analysis also leads to scalability issues, especially when applied to large industrial systems. Recently, a set of novel techniques was proposed, called FAST-R, relying solely on test case code for test case minimization, which appeared to be much more efficient than white-box techniques. However, it achieved a comparable low fault detection capability for Java projects, thus making its application challenging in practice. In this paper, we propose ATM (AST-based Test case Minimizer), a similarity-based, search-based test case minimization technique, taking a specific budget as input, that also relies exclusively on the source code of test cases but attempts to achieve higher fault detection through finer-grained similarity analysis and a dedicated search algorithm. ATM transforms test case code into Abstract Syntax Trees (AST) and relies on four tree-based similarity measures to apply evolutionary search, specifically genetic algorithms, to minimize test cases. We evaluated the effectiveness and efficiency of ATM on a large dataset of 16 Java projects with 661 faulty versions using three budgets ranging from 25% to 75% of test suites. ATM achieved significantly higher fault detection rates ( 0.82 on average), compared to FAST-R ( 0.61 on average) and random minimization (0.52 on average), when running only 50% of the test cases, within practically acceptable time ( 1.1 - 4.3 hours, on average, per project version), given that minimization is only occasionally applied when many new test cases are created (major releases). Results achieved for other budgets were consistent.
引用
收藏
页码:1700 / 1711
页数:12
相关论文
共 50 条
  • [31] Coverage metrics to measure adequacy of black-box test suites
    Rajan, Ajitha
    ASE 2006: 21ST IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS, 2006, : 335 - 338
  • [32] Uncertainty-Driven Black-Box Test Data Generation
    Walkinshaw, Neil
    Fraser, Gordon
    2017 10TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST), 2017, : 253 - 263
  • [33] Quantum Sequencer for the Minimal Test Synthesis of Black-box Functionality
    Hahanov, Vladimir
    Iemelianov, Igor
    Chumachenko, Svetlana
    Hahanov, Ivan
    Hahanova, Irina
    2017 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2017,
  • [34] Assessing Test Adequacy for Black-Box Systems without Specifications
    Walkinshaw, Neil
    TESTING SOFTWARE AND SYSTEMS, 2011, 7019 : 209 - 224
  • [35] Black-Box Test-Coverage Analysis and Test-Cost Reduction Based on a Bayesian Network Model
    Pan, Renjian
    Zhang, Zhaobo
    Li, Xin
    Chakrabarty, Krishnendu
    Gu, Xinli
    2019 IEEE 37TH VLSI TEST SYMPOSIUM (VTS), 2019,
  • [36] A Black-Box Attack on Code Models via Representation Nearest Neighbor Search
    Zhang, Jie
    Ma, Wei
    Hui, Qiang
    Liu, Shangqing
    Xie, Xiaofei
    Le Traon, Yves
    Liu, Yang
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (EMNLP 2023), 2023, : 9706 - 9716
  • [37] A Constraint-Based Framework for Test Case Generation in Method-Level Black-Box Unit Testing
    Chang, Chi-Kuang
    Lin, Nai-Wei
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2016, 32 (02) : 365 - 387
  • [38] Pareto efficient multi-objective black-box test case selection for simulation-based testing
    Arrieta, Aitor
    Wang, Shuai
    Markiegi, Urtzi
    Arruabarrena, Ainhoa
    Etxeberria, Leire
    Sagardui, Goiuria
    INFORMATION AND SOFTWARE TECHNOLOGY, 2019, 114 : 137 - 154
  • [39] A study on a path-based strategy for selecting black-box generated test cases
    Yu, YT
    Tang, SF
    Poon, PL
    Chen, TY
    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2001, 11 (02) : 113 - 138
  • [40] Intelligent Local Search for Test Case Minimization
    Mohapatra S.K.
    Mishra A.K.
    Prasad S.
    Journal of The Institution of Engineers (India): Series B, 2020, 101 (05) : 585 - 595