Please use this identifier to cite or link to this item:
|Title:||Hierarchical dynamic slicing|
|Authors:||Wang, T. |
|Citation:||Wang, T.,Roychoudhury, A. (2007). Hierarchical dynamic slicing. 2007 ACM International Symposium on Software Testing and Analysis, ISSTA'07 : 228-238. ScholarBank@NUS Repository. https://doi.org/10.1145/1273463.1273494|
|Abstract:||Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity. The basic observation is to divide a program execution trace into "phases", with data/control dependencies inside each phase being suppressed. Only the inter-phase dependencies are presented to the programmer. The programmer then zooms into one of these phases which is further divided into sub-phases and analyzed. We also discuss how our ideas can be used to augment debugging methods other then slicing (such as "fault localization", a recently proposed trace comparison method for software debugging).|
|Source Title:||2007 ACM International Symposium on Software Testing and Analysis, ISSTA'07|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2019
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.