Sciweavers

10 search results - page 1 / 2
» Memoized Forward Computation of Dynamic Slices
Sort
View
ISSRE
2006
IEEE
13 years 11 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski
ACTAC
2002
102views more  ACTAC 2002»
13 years 4 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
ICSE
2004
IEEE-ACM
14 years 4 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
CSMR
2007
IEEE
13 years 11 months ago
Verifying the Concept of Union Slices on Java Programs
Static program slicing is often proposed for software maintenance-related tasks. Due to different causes static slices are in many cases overly conservative and hence too large to...
Attila Szegedi, Tamás Gergely, Árp&a...
ESOP
2005
Springer
13 years 10 months ago
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
Michael Leuschel, Germán Vidal