1990
DOI: 10.1145/93548.93576
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic program slicing

Abstract: Program slices are useful in debugging, testing, maintenance, and understanding of programs. The conventional notion of a program slice, the static slice , is the set of all statements that might affect the value of a given variable occurrence. In this paper, we investigate the concept of the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
283
0

Year Published

1997
1997
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 316 publications
(283 citation statements)
references
References 9 publications
0
283
0
Order By: Relevance
“…Static slicing [52] identifies a subset of program statements that may influence the value of a variable at a program location. Dynamic slicing [53][54][55] finds the statements that actually do influence a variable value in a particular execution. Relevant Slicing [56,57] is similar to dynamic slicing, but additionally finds statements that can potentially influence a variable value in an execution, if a predicate were to evaluate to a different outcome.…”
Section: Related Workmentioning
confidence: 99%
“…Static slicing [52] identifies a subset of program statements that may influence the value of a variable at a program location. Dynamic slicing [53][54][55] finds the statements that actually do influence a variable value in a particular execution. Relevant Slicing [56,57] is similar to dynamic slicing, but additionally finds statements that can potentially influence a variable value in an execution, if a predicate were to evaluate to a different outcome.…”
Section: Related Workmentioning
confidence: 99%
“…Dynamic slicing [Agrawal and Horgan 1990;Gyimóthy et al 1999] is a variant of slicing that takes into account program execution trace information. Specifically, dynamic slicing only considers program dependencies that occur in a specific execution of the program.…”
Section: Dynamic Analysismentioning
confidence: 99%
“…As originally formulated by Korel and Laski [15], a dynamic slice of a program P is defined by three parameters besides P , namely a variable set V , an initial input state d and an integer n. The slice with respect to these parameters is required to follow the same path as P up to the nth statement (with statements not lying in the slice deleted from the path through the slice) and give the same value for each element of V as P after the nth statement after execution from the initial state d. Many dynamic slicing algorithms have been written [16,17,18,19,20,15,21,22]. Most of these compute a slice using the data and control dependence relations along the given path through the original program.…”
Section: Introductionmentioning
confidence: 99%