Brunel University Research Archive (BURA) >
Research Areas >
Information Systems and Computing >

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

Title: Static program slicing algorithms are minimal for free liberal program schemas
Authors: Danicic, S
Fox, CJ
Harman, M
Hierons, RM
Howroyd, J
Laurence, MR
Keywords: Program slicing
Minimal slicing
Static slicing
Publication Date: 2005
Publisher: Oxford Univerity Press
Citation: The Computer Journal 48(6): 737-748, Jul 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.
URI: http://comjnl.oxfordjournals.org/
http://bura.brunel.ac.uk/handle/2438/336
DOI: http://dx.doi.org/10.1093/comjnl/bxh121
Appears in Collections:B-SERC Research Papers
Information Systems and Computing
School of Information Systems, Computing and Mathematics Research Papers

Files in This Item:

File Description SizeFormat
Static Program 2005.pdf592.33 kBAdobe PDFView/Open

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

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan