(Enter summary)
Abstract: Dynamic slicing algorithms can greatly reduce the debugging
effort by focusing the attention of the user on a relevant
subset of program statements. In this paper we present
the design and evaluation of three precise dynamic slicing
algorithms called the full preprocessing (FP), no preprocessing
(NP) and limited preprocessing (LP) algorithms.
The algorithms differ in the relative timing of constructing
the dynamic data dependence graph and its traversal
for computing requested dynamic slices.... (Update)
Cited by: More
Analysis and Visualization of - Predicate Dependence On
(Correct)
Eliciting Design Requirements for Maintenance-Oriented IDEs.. - Ko, Aung, Myers (2005)
(Correct)
Dynamic Path Conditions in Dependence Graphs - Hammer, Grimme, Krinke (2006)
(Correct)
Active bibliography (related documents): More All
0.7: Cost Effective Dynamic Program Slicing - Xiangyu Zhang Rajiv (2004)
(Correct)
0.5: Efficient Forward Computation of Dynamic Slices Using - Reduced Ordered Binary
(Correct)
0.3: Union Slices for Program Maintenance - Arpad Beszedes Csaba (2002)
(Correct)
Similar documents based on text: More All
0.8: Dynamic Slicing Method for Maintenance of Large C.. - Beszedes, Gergely.. (2001)
(Correct)
0.6: Program Slicing: Methods and Applications - De Lucia (2001)
(Correct)
0.6: A Hybrid Program Slicing Framework - Rilling, Karanth (2001)
(Correct)
Related documents from co-citation: More All
6: A Survey of Program Slicing Techniques
- Tip - 1995
5: Experimental results from dynamic slicing of C programs (context) - Venkatesh - 1995
5: Program Slicing (context) - Weiser - 1984
BibTeX entry: (Update)
X. Zhang, R. Gupta, and Y. Zhang, "Precise Dynamic Slicing Algorithms," IEEE/ACM International Conference on Software Engineering, pages 319-329, Portland, Oregon, May 2003. http://citeseer.ist.psu.edu/zhang03precise.html More
@misc{ zhang03precise,
author = "X. Zhang and R. Gupta and Y. Zhang",
title = "Precise Dynamic Slicing Algorithms",
text = "X. Zhang, R. Gupta, and Y. Zhang, Precise Dynamic Slicing Algorithms, IEEE/ACM
International Conference on Software Engineering, pages 319-329, Portland,
Oregon, May 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/zhang03precise.html" }
Citations (may not include all citations):
265
Program Slicing (context) - Weiser - 1982
259
A Survey of Program Slicing Techniques
- Tip - 1995
131
Dynamic Program Slicing
- Agrawal, Horgan - 1990
50
Debugging with Dynamic Slicing and Backtracking
- Agrawal, DeMillo et al. - 1993
35
Dynamic Program Slicing (context) - Korel, Laski - 1988
32
Interprocedural Dynamic Slicing with Applications to Debuggi.. (context) - Kamkar - 1993
14
Experimental Results from Dynamic Slicing of C Programs (context) - Venkatesh - 1995
11
Forward computation of dynamic program slices (context) - Korel, Yalamanchili - 1994
10
Hybrid Slicing: An Approach for Refining Static Slices using..
- Gupta, Soffa - 1995
7
Dynamic Slicing Method for Maintenance of Large C Programs
- Beszedes, Gergely et al. - 2001
5
Evaluation and Comparison of Program Slicing Tools
- Hoffner - 1995
1
Program Slicing Using Dynamic Points-to Data
- Atkinson, Mock et al. - 2002
Documents on the same site (http://www.cs.arizona.edu/people/gupta/research/Publications/all.html): More
Partial Dead Code Elimination using Slicing Transformations - Bodik, Gupta (1997)
(Correct)
A Code Motion Framework for Global Instruction Scheduling - Gupta (1998)
(Correct)
Path Profile Guided Partial Dead Code Elimination Using.. - Gupta, Berson, Fang (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC