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 |
Issue 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: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Static Program 2005.pdf | 592.33 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.