一句话：利用失败测试用例覆盖率过滤提交，大幅缩小 bug 引入提交的检索空间。
本文关注从版本历史中定位 bug 引入提交（BIC）的准确性与成本问题。现有自动二分法要求揭示 bug 的测试能在所有候选旧版本上执行，而 SZZ 类归因方法要求 bug 已被修复。作者提出用 bug 揭示测试用例的覆盖率来过滤提交，从而在二分和 SZZ 类归因之前削减候选集合。在实验中，该方法分别将二分与 SZZ 类模型的搜索空间缩小 87.6% 和 27.9%，显著降低 BIC 检索开销。将其应用于 Defects4J 的 bug 时，还发现文献中部分已知 BIC 存在不一致。
Knowing how exactly a bug has been introduced into the code can help developers debug the bug efficiently. However, techniques currently used to retrieve Bug Inducing Commits (BICs) from the repository timeline are limited in their accuracy. Automated bisection of the version history depends on the bug revealing test case being executable against all candidate previous versions, whereas blaming the last commits that touched the same parts as the fixing commit (à la SZZ) requires that the bug has already been fixed. We show that filtering commits using the coverage of the bug revealing test cases can effectively reduce the search space for both bisection and SZZ-like blame models by 87.6% and 27.9%, respectively, significantly reducing the cost of BIC retrieval. The application of our approach to bugs in Defects4J also reveals inconsistencies in some of their BICs known in the literature.
DOI 原文 ·
@inproceedings{paperbot6462,
title = {Reducing the search space of bug inducing commits using failure coverage},
author = {Gabin An and Shin Yoo},
booktitle = {FSE},
year = {2021},
doi = {10.1145/3468264.3473129}
}