DMCA
ABSTRACT Experimental Evaluation of Using Dynamic Slices for Fault Location ∗
Cached
Download Links
BibTeX
@MISC{Zhang_abstractexperimental,
author = {Xiangyu Zhang and Haifeng He and Neelam Gupta and Rajiv Gupta},
title = {ABSTRACT Experimental Evaluation of Using Dynamic Slices for Fault Location ∗},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
fault location using dynamic slice abstract experimental evaluation faulty statement ordered binary decision diagram relevant slicing algorithm detailed experiment data slicing full slicing detailed study program statement automated debugging dynamic slicing framework dynamic instrumentation dynamic slice relevant slice dynamic slicing many year full slice
