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.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
zhuyiyi发布了新的文献求助10
刚刚
思源应助xinxin采纳,获得10
刚刚
卡卡卡卡卡卡完成签到,获得积分10
1秒前
zzsc完成签到,获得积分10
1秒前
1秒前
活力的听露完成签到 ,获得积分10
1秒前
宋世伟发布了新的文献求助10
1秒前
15987342672发布了新的文献求助10
1秒前
2秒前
Daixi_Chen完成签到,获得积分10
2秒前
文静达完成签到,获得积分10
2秒前
小蘑菇应助WM采纳,获得10
2秒前
彭于晏应助fang采纳,获得10
2秒前
机灵语雪完成签到,获得积分10
3秒前
负责的幻天完成签到,获得积分10
4秒前
5秒前
5秒前
gfsuen完成签到 ,获得积分10
5秒前
乐乐应助Daixi_Chen采纳,获得10
6秒前
二东发布了新的文献求助10
6秒前
开始游戏55完成签到,获得积分10
6秒前
仁爱的觅夏完成签到,获得积分10
6秒前
承睿睿完成签到,获得积分10
8秒前
天天快乐应助月月采纳,获得10
8秒前
呼初南发布了新的文献求助10
8秒前
科研通AI6.2应助鉴湖采纳,获得10
8秒前
852应助路遥采纳,获得10
9秒前
chenyuyuan完成签到,获得积分10
9秒前
9秒前
Ava应助宋世伟采纳,获得10
10秒前
11秒前
cici发布了新的文献求助10
12秒前
12秒前
12秒前
波风水门发布了新的文献求助10
13秒前
13秒前
14秒前
YuxinChen完成签到 ,获得积分10
15秒前
今后应助jessica采纳,获得30
15秒前
无敌大好人完成签到,获得积分10
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Polymorphism and polytypism in crystals 1000
Relation between chemical structure and local anesthetic action: tertiary alkylamine derivatives of diphenylhydantoin 1000
Signals, Systems, and Signal Processing 610
Discrete-Time Signals and Systems 610
Checklist of Yunnan Pieridae (Lepidoptera: Papilionoidea) with nomenclature and distributional notes 500
Der Gleislage auf der Spur 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6074904
求助须知:如何正确求助?哪些是违规求助? 7906194
关于积分的说明 16347646
捐赠科研通 5213391
什么是DOI,文献DOI怎么找? 2788135
邀请新用户注册赠送积分活动 1770913
关于科研通互助平台的介绍 1648343