Danicic, Sebastian; Fox, Chris; Harman, Mark; Hierons, Robert; Howroyd, John and Laurence, Michael. 2005. Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas. The Computer Journal, 48(6), pp. 737-748. ISSN 0010-4620 [Article]

No full text available

Abstract or Description

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.

Item Type:	Article
Identification Number (DOI):	https://doi.org/10.1093/comjnl/bxh121
Departments, Centres and Research Units:	Computing
Dates:	Date Event 2005 Published
Item ID:	15214
Date Deposited:	02 Dec 2015 13:05
Last Modified:	13 Jun 2016 12:33
Peer Reviewed:	Yes, this version has been peer-reviewed.
URI:	https://research.gold.ac.uk/id/eprint/15214

Edit Record (login required)