Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas

Authors:
Sebastian Danicic;Chris Fox;Mark Harman;Rob Hierons;John Howroyd;Michael R. Laurence
Affiliations:
Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK;Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK;Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK;School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, UK;@UK PLC, 5 Jupiter House, Calleva Park, Aldermaston, Berkshire RG7 8NN, UK;Department of Computer Science, University of Liverpool, Peach Street, Liverpool L69 3BX, UK
Venue:
The Computer Journal
Year:
2005

Citing 0
Cited 6

A formalisation of the relationship between forms of program slicing

Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

Theoretical Computer Science
A trajectory-based strict semantics for program slicing

Theoretical Computer Science
On the computational complexity of dynamic slicing problems for program schemas

Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Complexity of Data Dependence Problems for Program Schemas with Concurrency

ACM Transactions on Computational Logic (TOCL)
A vocabulary of program slicing-based techniques

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing is an automated source code extraction technique that has been applied to a number of problems including testing, debugging, maintenance, reverse engineering, program comprehension, reuse and program integration. In all these applications the size of the slice is crucial; the smaller the better. It is known that statement minimal slices are not computable, but the question of dataflow minimal slicing has remained open since Weiser posed it in 1979. This paper proves that static slicing algorithms produce dataflow minimal end slices for programs which can be represented as schemas which are free and liberal.