Bayesian Approach for Regression Testing (BART) using Test Suite Prioritization

Prabuddh Gupta, Divya Balakrishna, Rohit R. Shende, Vikram Raina, Shalini Lal, Aditya Doshatti, Lalitha Sripada, Mitesh Sharma, Shiva Thamilavel
{"title":"Bayesian Approach for Regression Testing (BART) using Test Suite Prioritization","authors":"Prabuddh Gupta, Divya Balakrishna, Rohit R. Shende, Vikram Raina, Shalini Lal, Aditya Doshatti, Lalitha Sripada, Mitesh Sharma, Shiva Thamilavel","doi":"10.1109/STC55697.2022.00027","DOIUrl":null,"url":null,"abstract":"Majority of the current state-of-the-art test suite (TS) prioritization algorithms for black-box testing focus on improving average percentage of fault detected (APFD) metric. These however suffer from two critical challenges 1) high time complexity of $\\ge O(n^{2})$ where n is the number of test suites, and 2) limited ability to self-stop TS Prioritization (TSP) computation if the system under test (SUT) becomes highly stable. In this work we present an approach to overcome these two challenges while achieving high APFD efficiency over the conventional random ordering. A novel algorithm called Bayesian approach to regression testing (BART) is developed herein which models continuous integration (CI) cycle’s attributes like test suite life cycle (TSLC), stability and bugs as Bayesian inference pattern namely Dirichlet-Multinomial model. This work demonstrates that BART’s APFD metrics improve significantly in comparison to conventional random ordering and therefore this approach achieves for the first time a complexity of $O(nlogn)$ for black-box based test prioritization.","PeriodicalId":170123,"journal":{"name":"2022 IEEE 29th Annual Software Technology Conference (STC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 29th Annual Software Technology Conference (STC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STC55697.2022.00027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Majority of the current state-of-the-art test suite (TS) prioritization algorithms for black-box testing focus on improving average percentage of fault detected (APFD) metric. These however suffer from two critical challenges 1) high time complexity of $\ge O(n^{2})$ where n is the number of test suites, and 2) limited ability to self-stop TS Prioritization (TSP) computation if the system under test (SUT) becomes highly stable. In this work we present an approach to overcome these two challenges while achieving high APFD efficiency over the conventional random ordering. A novel algorithm called Bayesian approach to regression testing (BART) is developed herein which models continuous integration (CI) cycle’s attributes like test suite life cycle (TSLC), stability and bugs as Bayesian inference pattern namely Dirichlet-Multinomial model. This work demonstrates that BART’s APFD metrics improve significantly in comparison to conventional random ordering and therefore this approach achieves for the first time a complexity of $O(nlogn)$ for black-box based test prioritization.
使用测试套件优先级的回归测试贝叶斯方法(BART)
目前大多数用于黑盒测试的最先进的测试套件(TS)优先级算法都关注于提高故障检测的平均百分比(APFD)度量。然而,这些方法面临两个关键挑战:1)高时间复杂度$ $ O(n^{2})$,其中n是测试套件的数量;2)如果被测系统(SUT)变得高度稳定,则自停止TS优先级(TSP)计算的能力有限。在这项工作中,我们提出了一种方法来克服这两个挑战,同时实现比传统随机排序更高的APFD效率。本文提出了一种新的贝叶斯回归测试方法(BART),该方法将持续集成(CI)周期的测试套件生命周期(TSLC)、稳定性和bug等属性建模为贝叶斯推理模式,即Dirichlet-Multinomial模型。这项工作表明,与传统的随机排序相比,BART的APFD指标有了显著的改善,因此这种方法首次实现了基于黑盒的测试优先级复杂度为$ 0 (nlogn)$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信