当前位置: X-MOL 学术IEEE Trans. Reliab. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Ant Colony System With Sorting-Based Local Search for Coverage-Based Test Case Prioritization
IEEE Transactions on Reliability ( IF 5.9 ) Pub Date : 2020-09-01 , DOI: 10.1109/tr.2019.2930358
Chengyu Lu , Jinghui Zhong , Yinxing Xue , Liang Feng , Jun Zhang

Test case prioritization (TCP) is a popular regression testing technique in software engineering field. The task of TCP is to schedule the execution order of test cases so that certain objective (e.g., code coverage) can be achieved quickly. In this article, we propose an efficient ant colony system framework for the TCP problem, with the aim of maximizing the code coverage as soon as possible. In the proposed framework, an effective heuristic function is proposed to guide the ants to construct solutions based on additional statement coverage among remaining test cases. Besides, a sorting-based local search mechanism is proposed to further accelerate the convergence speed of the algorithm. Experimental results on different benchmark problems, and a real-world application, have shown that the proposed framework can outperform several state-of-the-art methods, in terms of solution quality and search efficiency.

中文翻译:

具有基于排序的本地搜索的基于覆盖的测试用例优先级排序的蚁群系统

测试用例优先级(TCP)是软件工程领域中一种流行的回归测试技术。TCP 的任务是调度测试用例的执行顺序,以便可以快速实现某个目标(例如代码覆盖率)。在本文中,我们针对 TCP 问题提出了一个高效的蚁群系统框架,旨在尽快最大化代码覆盖率。在所提出的框架中,提出了一个有效的启发式函数来指导蚂蚁基于剩余测试用例之间的额外语句覆盖率构建解决方案。此外,提出了一种基于排序的局部搜索机制,以进一步加快算法的收敛速度。不同基准问题的实验结果,以及实际应用,
更新日期:2020-09-01
down
wechat
bug