Experimental evaluation of using dynamic slices for fault location

  • Authors:

  • Xiangyu Zhang;Haifeng He;Neelam Gupta;Rajiv Gupta

  • Affiliations:

  • The University of Arizona, Tucson, Arizona;The University of Arizona, Tucson, Arizona;The University of Arizona, Tucson, Arizona;The University of Arizona, Tucson, Arizona

  • Venue:
  • Proceedings of the sixth international symposium on Automated analysis-driven debugging
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic slicing for detecting faulty statements in programs have been carried out. We have developed a dynamic slicing framework that uses dynamic instrumentation to efficiently collect dynamic slices and reduced ordered Binary Decision Diagrams (roBDDs) to compactly store them. We have used the above framework to implement three variants of dynamic slicing algorithms including: data slicing, full slicing, and relevant slicing algorithms. We have carried out detailed experiments to evaluate these algorithms. Our results show that full slices and relevant slices can considerably reduce the subset of program statements that need to be examined to locate faulty statements. We expect that the observations presented here will enable development of new slicing based algorithms for automated debugging.