Locating Faults with Program Slicing: An Empirical Analysis
Ezekiel Soremekun, Lukas Kirschner, Marcel B\"ohme, Andreas Zeller

TL;DR
This study compares statistical fault localization and dynamic slicing in identifying faulty code, finding that dynamic slicing is more effective for single faults, but a hybrid approach offers the best overall efficiency.
Contribution
It provides an empirical comparison of fault localization techniques and demonstrates the effectiveness of a hybrid approach combining statistical debugging and dynamic slicing.
Findings
Dynamic slicing outperforms statistical debugging for single faults.
Statistical debugging performs better on multiple faults.
A hybrid approach reduces the code examined by 15%.
Abstract
Statistical fault localization is an easily deployed technique for quickly determining candidates for faulty code locations. If a human programmer has to search the fault beyond the top candidate locations, though, more traditional techniques of following dependencies along dynamic slices may be better suited. In a large study of 457 bugs (369 single faults and 88 multiple faults) in 46 open source C programs, we compare the effectiveness of statistical fault localization against dynamic slicing. For single faults, we find that dynamic slicing was eight percentage points more effective than the best performing statistical debugging formula; for 66% of the bugs, dynamic slicing finds the fault earlier than the best performing statistical debugging formula. In our evaluation, dynamic slicing is more effective for programs with single fault, but statistical debugging performs better on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
