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 条
  • [31] Similarity-based prioritization of test case automation
    Daniel Flemström
    Pasqualina Potena
    Daniel Sundmark
    Wasif Afzal
    Markus Bohlin
    Software Quality Journal, 2018, 26 : 1421 - 1449
  • [32] Similarity-based prioritization of test case automation
    Flemstrom, Daniel
    Potena, Pasqualina
    Sundmark, Daniel
    Afzal, Wasif
    Bohlin, Markus
    SOFTWARE QUALITY JOURNAL, 2018, 26 (04) : 1421 - 1449
  • [33] Ranking-Based Black-Box Complexity
    Doerr, Benjamin
    Winzen, Carola
    ALGORITHMICA, 2014, 68 (03) : 571 - 609
  • [34] Ranking-Based Black-Box Complexity
    Benjamin Doerr
    Carola Winzen
    Algorithmica, 2014, 68 : 571 - 609
  • [35] White-Box and Black-Box Test Quality Metrics for Configurable Simulation Models
    Markiegi, Urtzi
    Arrieta, Aitor
    Etxeberria, Leire
    Sagardui, Goiuria
    23RD INTERNATIONAL SYSTEMS AND SOFTWARE PRODUCT LINE CONFERENCE(SPLC 2019), VOL B, 2019, : 211 - 214
  • [36] A kriging-based approach to MINLP containing black-box models and noise
    Davis, Eddie
    Ierapetritou, Marianthi
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2008, 47 (16) : 6101 - 6125
  • [37] Similarity-based models of human visual recognition
    Unzicker, A
    Jüttner, M
    Rentschler, I
    VISION RESEARCH, 1998, 38 (15-16) : 2289 - 2305
  • [38] DEVS-SCRIPTING: A BLACK-BOX TEST FRAME FOR DEVS MODELS
    McLaughlin, Matthew B.
    Sarjoughian, Hessam S.
    2020 WINTER SIMULATION CONFERENCE (WSC), 2020, : 2196 - 2207
  • [39] Similarity-based models of word cooccurrence probabilities
    Dagan, I
    Lee, L
    Pereira, FCN
    MACHINE LEARNING, 1999, 34 (1-3) : 43 - 69
  • [40] Blacklight: Scalable Defense for Neural Networks against Query-Based Black-Box Attacks
    Li, Huiying
    Shan, Shawn
    Wenger, Emily
    Zhang, Jiayun
    Zheng, Haitao
    Zhao, Ben Y.
    PROCEEDINGS OF THE 31ST USENIX SECURITY SYMPOSIUM, 2022, : 2117 - 2134