LTM: Scalable and Black-Box Similarity-Based Test Suite Minimization Based on Language Models

被引:0
|
作者
Pan, Rongqi [1 ]
Ghaleb, Taher A. [2 ,3 ]
Briand, Lionel C. [4 ,5 ]
机构
[1] Univ Ottawa, Sch EECS, Ottawa, ON K1N 6N5, Canada
[2] Trent Univ, Comp Sci Dept, Peterborough, ON K9L 0G2, Canada
[3] Univ Ottawa, Ottawa, ON K1N 6N5, Canada
[4] Univ Limerick, Lero SFI Ctr Software Res, Limerick V94T9PX, Ireland
[5] Univ Ottawa, Sch EECS, Ottawa, ON K1N 6N5, Canada
基金
加拿大自然科学与工程研究理事会; 爱尔兰科学基金会;
关键词
Minimization; Codes; Fault detection; Closed box; Scalability; Time measurement; Genetic algorithms; Source coding; Vectors; Unified modeling language; Test suite minimization; test suite reduction; pre-trained language models; genetic algorithm; black-box testing; SELECTION; PRIORITIZATION;
D O I
10.1109/TSE.2024.3469582
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Test suites tend to grow when software evolves, making it often infeasible to execute all test cases with the allocated testing budgets, especially for large software systems. Test suite minimization (TSM) is employed to improve the efficiency of software testing by removing redundant test cases, thus reducing testing time and resources while maintaining the fault detection capability of the test suite. Most existing TSM approaches rely on code coverage (white-box) or model-based features, which are not always available to test engineers. Recent TSM approaches that rely only on test code (black-box) have been proposed, such as ATM and FAST-R. The former yields higher fault detection rates (FDR) while the latter is faster. To address scalability while retaining a high FDR, we propose LTM (<bold>L</bold>anguage model-based<bold> </bold>Test suite Minimization), a novel, scalable, and black-box similarity-based TSM approach based on large language models (LLMs), which is the first application of LLMs in the context of TSM. To support similarity measurement using test method embeddings, we investigate five different pre-trained language models: CodeBERT, GraphCodeBERT, UniXcoder, StarEncoder, and CodeLlama, on which we compute two similarity measures: Cosine Similarity and Euclidean Distance. Our goal is to find similarity measures that are not only computationally more efficient but can also better guide a Genetic Algorithm (GA), which is used to search for optimal minimized test suites, thus reducing the overall search time. Experimental results show that the best configuration of LTM (UniXcoder/Cosine) outperforms ATM in three aspects: (a) achieving a slightly greater saving rate of testing time ($41.72\%$41.72% versus $41.02\%$41.02%, on average); (b) attaining a significantly higher fault detection rate ($0.84$0.84 versus $0.81$0.81, on average); and, most importantly, (c) minimizing test suites nearly five times faster on average, with higher gains for larger test suites and systems, thus achieving much higher scalability.
引用
收藏
页码:3053 / 3070
页数:18
相关论文
共 50 条
  • [1] ATM: Black-box Test Case Minimization based on Test Code Similarity and Evolutionary Search
    Pan, Rongqi
    Ghaleb, Taher A.
    Briand, Lionel
    2023 IEEE/ACM 45TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ICSE, 2023, : 1700 - 1711
  • [2] Developmental Bayesian Optimization of Black-Box with Visual Similarity-Based Transfer Learning
    Petit, Maxime
    Depierre, Amaury
    Wang, Xiaofang
    Dellandrea, Emmanuel
    Chen, Liming
    2018 JOINT IEEE 8TH INTERNATIONAL CONFERENCE ON DEVELOPMENT AND LEARNING AND EPIGENETIC ROBOTICS (ICDL-EPIROB), 2018, : 161 - 168
  • [3] FAST Approaches to Scalable Similarity-based Test Case Prioritization
    Miranda, Breno
    Cruciani, Emilio
    Verdecchia, Roberto
    Bertolino, Antonia
    PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE), 2018, : 222 - 232
  • [4] Black-Box Test-Cost Reduction Based on Bayesian Network Models
    Pan, Renjian
    Zhang, Zhaobo
    Li, Xin
    Chakrabarty, Krishnendu
    Gu, Xinli
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2021, 40 (02) : 386 - 399
  • [5] Black-Box Performance Models: Prediction based on Observation
    Happe, Jens
    Li, Hui
    Theilmann, Wolfgang
    QUASSOSS 09: 1ST INTERNATIONAL WORKSHOP ON THE QUALITY OF SERVICE-ORIENTED SOFTWARE SYSTEM, 2009, : 19 - 24
  • [6] Auditing Black-Box Prediction Models for Data Minimization Compliance
    Rastegarpanah, Bashir
    Gummadi, Krishna P.
    Crovella, Mark
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [7] Reducing Black-box Test Suite Using Input Parameter Relationships
    Wang, Lixin
    22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING & KNOWLEDGE ENGINEERING (SEKE 2010), 2010, : 180 - 185
  • [8] Scalable Inference for Gaussian Process Models with Black-Box Likelihoods
    Dezfouli, Amir
    Bonilla, Edwin V.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [9] Ensembles of similarity-based models
    Duch, W
    Grudzinski, K
    INTELLIGENT INFORMATION SYSTEMS 2001, 2001, : 75 - 85
  • [10] Similarity-based minimization of fuzzy tree automata
    Moghari S.
    Zahedi M.M.
    Journal of Applied Mathematics and Computing, 2016, 50 (1-2) : 417 - 436