A Survey of Program Slicing Techniques

A Survey of Program Slicing Techniques (1995)

by F. Tip

Venue:	JOURNAL OF PROGRAMMING LANGUAGES
Citations:	572 - 10 self

User correction supplied by brindhabose

Datum	Value	Source
TITLE	A Survey of Program Slicing Techniques	user correction - Legacy Corrections
AUTHOR NAME	F. Tip	user correction
AUTHOR AFFIL	Computer Science/Department of Software Technology	user correction
ABSTRACT	A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input, whereas the latter relies on some specific test case. Procedures, arbitrary control flow, composite datatypes and pointers, and interprocess communication each require a specific solution. We classify static and dynamic slicing methods for each of these features, and compare their accuracy and efficiency. Moreover, the possibilities for combining solutions for different features are investigated....	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	JOURNAL OF PROGRAMMING LANGUAGES	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	121--189	INFERENCE
VOLUME	3	INFERENCE
CITATIONS	87 found	ParsCit 1.0