A parallel algorithm for static program slicing

Sebastian Danicic; Mark Harman; Yogasundary Sivagurunathan

doi:10.1016/0020-0190(95)00170-0

A parallel algorithm for static program slicing

Sebastian Danicic, Mark Harman, Yogasundary Sivagurunathan

Informatics

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

Abstract

Program Slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the first parallel slicing algorithm for static program slicing is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser's original static slicing algorithm.

Original language	English
Article number	N/A
Pages (from-to)	307-313
Number of pages	7
Journal	INFORMATION PROCESSING LETTERS
Volume	56
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(95)00170-0
Publication status	Published - 22 Dec 1995

Access to Document

10.1016/0020-0190(95)00170-0

Cite this

@article{cb456061e51a41768b3f17df6e60f540,

title = "A parallel algorithm for static program slicing",

abstract = "Program Slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the first parallel slicing algorithm for static program slicing is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser's original static slicing algorithm.",

author = "Sebastian Danicic and Mark Harman and Yogasundary Sivagurunathan",

year = "1995",

month = dec,

day = "22",

doi = "10.1016/0020-0190(95)00170-0",

language = "English",

volume = "56",

pages = "307--313",

journal = "INFORMATION PROCESSING LETTERS",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - A parallel algorithm for static program slicing

AU - Danicic, Sebastian

AU - Harman, Mark

AU - Sivagurunathan, Yogasundary

PY - 1995/12/22

Y1 - 1995/12/22

N2 - Program Slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the first parallel slicing algorithm for static program slicing is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser's original static slicing algorithm.

AB - Program Slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the first parallel slicing algorithm for static program slicing is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser's original static slicing algorithm.

U2 - 10.1016/0020-0190(95)00170-0

DO - 10.1016/0020-0190(95)00170-0

M3 - Article

SN - 0020-0190

VL - 56

SP - 307

EP - 313

JO - INFORMATION PROCESSING LETTERS

JF - INFORMATION PROCESSING LETTERS

IS - 6

M1 - N/A

ER -

A parallel algorithm for static program slicing

Abstract

Access to Document

Fingerprint

Cite this