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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
zxf完成签到,获得积分20
刚刚
cassiecx发布了新的文献求助10
刚刚
七七发布了新的文献求助10
刚刚
1秒前
福明明完成签到,获得积分10
1秒前
zxf发布了新的文献求助10
1秒前
2秒前
要努力写文章的小白完成签到,获得积分10
2秒前
FashionBoy应助蜜蜜芪采纳,获得10
2秒前
gwt完成签到,获得积分10
3秒前
fish112发布了新的文献求助10
3秒前
Jing发布了新的文献求助10
3秒前
3秒前
浮游应助畅快的雅青采纳,获得10
4秒前
4秒前
hbhbj发布了新的文献求助10
4秒前
wyp发布了新的文献求助10
5秒前
prode完成签到,获得积分10
6秒前
6秒前
lalala应助黎明森采纳,获得10
6秒前
7秒前
sdaDAS发布了新的文献求助10
7秒前
8秒前
CipherSage应助guochang采纳,获得10
8秒前
Edward发布了新的文献求助30
9秒前
浮游应助和老爹豆豆采纳,获得10
9秒前
闫小天天完成签到,获得积分10
9秒前
9秒前
10秒前
11秒前
666发布了新的文献求助10
11秒前
英俊的铭应助热情的远锋采纳,获得10
11秒前
小二郎应助vebb采纳,获得10
12秒前
爆米花应助科研通管家采纳,获得10
12秒前
Criminology34应助科研通管家采纳,获得10
12秒前
12秒前
深情安青应助科研通管家采纳,获得10
12秒前
和谐诗双发布了新的文献求助10
12秒前
CodeCraft应助科研通管家采纳,获得10
12秒前
浮游应助科研通管家采纳,获得10
12秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Fermented Coffee Market 2000
PARLOC2001: The update of loss containment data for offshore pipelines 500
Critical Thinking: Tools for Taking Charge of Your Learning and Your Life 4th Edition 500
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 500
A Manual for the Identification of Plant Seeds and Fruits : Second revised edition 500
Constitutional and Administrative Law 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 遗传学 催化作用 冶金 量子力学 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 5264928
求助须知:如何正确求助?哪些是违规求助? 4425065
关于积分的说明 13775359
捐赠科研通 4300354
什么是DOI,文献DOI怎么找? 2359671
邀请新用户注册赠送积分活动 1355731
关于科研通互助平台的介绍 1317058