Research Online


Goldsmiths - University of London

A parallel algorithm for static program slicing

Danicic, Sebastian; Harman, Mark and Sivagurunathan, Yogasundary. 1995. A parallel algorithm for static program slicing. Information Processing Letters, 56(6), pp. 307-313. ISSN 0020-0190 [Article]

No full text available

Abstract or Description

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.

Item Type:


Identification Number (DOI):

Departments, Centres and Research Units:




Item ID:


Date Deposited:

02 Dec 2015 14:01

Last Modified:

13 Jun 2016 12:33

Peer Reviewed:

Yes, this version has been peer-reviewed.


Edit Record Edit Record (login required)