Brunel University Research Archive (BURA) >
University >
Publications >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6258

Title: Static program slicing algorithms are minimal for free liberal program schemas
Authors: Danicic, S
Fox, C
Harman, M
Hierons, RM
Howroyd, J
Laurence, MR
Publication Date: 2005
Publisher: Oxford University Press
Citation: Computer Journal 48(6): 737 - 748, Nov 2005
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.
Description: This is the post-print version of the Paper - Copyright @ 2005 Oxford University Press
URI: http://comjnl.oxfordjournals.org/content/48/6/737.abstract
http://bura.brunel.ac.uk/handle/2438/6258
DOI: http://dx.doi.org/10.1093/comjnl/bxh121
ISSN: 0010-4620
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf340.16 kBUnknownView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.