UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

A parallel algorithm for static program slicing

Danicic, S; Harman, M; Sivagurunathan, Y; (1995) A parallel algorithm for static program slicing. INFORM PROCESS LETT , 56 (6) 307 - 313.

Full text not available from this repository.

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.

Type: Article
Title: A parallel algorithm for static program slicing
Keywords: slicing, parallel algorithms, program simplification
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1302244
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item