Dynamic Code Coverage with Progressive Detail Levels
Alexandre Perez

TL;DR
This paper introduces DCC, a dynamic code coverage approach that progressively refines coverage detail to improve fault localization efficiency, reducing overhead and report size in software debugging.
Contribution
The paper presents a novel progressive coverage technique that minimizes instrumentation overhead while maintaining effective fault localization capabilities.
Findings
27% average reduction in execution time
63% average reduction in diagnostic report size
Effective fault localization with lower overhead
Abstract
Nowadays, locating software components responsible for observed failures is one of the most expensive and error-prone tasks in the software development process. To improve the debugging process efficiency, some effort was already made to automatically assist the detection and location of software faults. This led to the creation of statistical debugging tools such as Tarantula, Zoltar and GZoltar. These tools use information gathered from code coverage data and the result of test executions to return a list of potential faulty locations. Although helpful, fault localization tools have some scaling problems because of the fine-grained coverage data they need to perform the fault localization analysis. Instrumentation overhead, which in some cases can be as high as 50% is the main cause for their inefficiency. This thesis proposes a new approach to this problem, avoiding as much as…
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.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Software Reliability and Analysis Research · Software Engineering Research
