Reducing the search space of bug inducing commits using failure coverage

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 89
  • Download : 0
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.
Publisher
ACM
Issue Date
2021-08-25
Language
English
Citation

European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE 2021), pp.1459 - 1462

DOI
10.1145/3468264.3473129
URI
http://hdl.handle.net/10203/289011
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0