亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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

计算机科学 测试套件 代码覆盖率 测试用例 抽象语法树 故障覆盖率 可扩展性 缩小 相似性(几何) 自动测试模式生成 考试(生物学) Java 回归检验 语法 程序设计语言 软件 人工智能 机器学习 软件开发 操作系统 工程类 电子线路 电气工程 古生物学 回归分析 图像(数学) 软件建设 生物
作者
Rongqi Pan,Taher Ahmed Ghaleb,Lionel Briand
标识
DOI:10.1109/icse48619.2023.00146
摘要

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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Hello应助鬼见愁采纳,获得10
6秒前
16秒前
资白玉完成签到 ,获得积分0
32秒前
41秒前
yx_cheng应助科研通管家采纳,获得10
59秒前
量子星尘发布了新的文献求助10
1分钟前
1分钟前
鬼见愁发布了新的文献求助20
1分钟前
1分钟前
量子星尘发布了新的文献求助10
2分钟前
2分钟前
2分钟前
满意的伊完成签到,获得积分10
2分钟前
鬼见愁发布了新的文献求助10
2分钟前
2分钟前
量子星尘发布了新的文献求助10
3分钟前
3分钟前
沉沉完成签到 ,获得积分0
3分钟前
jxz9510完成签到 ,获得积分10
3分钟前
3分钟前
玛琳卡迪马完成签到 ,获得积分10
3分钟前
4分钟前
haralee完成签到 ,获得积分10
4分钟前
babulao完成签到,获得积分10
4分钟前
hwen1998完成签到 ,获得积分10
4分钟前
TongKY完成签到 ,获得积分10
4分钟前
4分钟前
比比谁的速度快应助stupidZ采纳,获得10
4分钟前
yx_cheng应助科研通管家采纳,获得10
4分钟前
4分钟前
yx_cheng应助科研通管家采纳,获得10
4分钟前
4分钟前
量子星尘发布了新的文献求助10
5分钟前
asdf完成签到,获得积分10
5分钟前
直率的笑翠完成签到 ,获得积分10
5分钟前
5分钟前
张张发布了新的文献求助10
5分钟前
6分钟前
量子星尘发布了新的文献求助10
6分钟前
6分钟前
高分求助中
【提示信息,请勿应助】关于scihub 10000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Social Research Methods (4th Edition) by Maggie Walter (2019) 2390
A new approach to the extrapolation of accelerated life test data 1000
北师大毕业论文 基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 390
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Robot-supported joining of reinforcement textiles with one-sided sewing heads 360
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4008330
求助须知:如何正确求助?哪些是违规求助? 3548050
关于积分的说明 11298670
捐赠科研通 3282900
什么是DOI,文献DOI怎么找? 1810249
邀请新用户注册赠送积分活动 885957
科研通“疑难数据库(出版商)”最低求助积分说明 811188