Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

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

Title: Unions of slices are not slices
Authors: De Lucia, A
Harman, M
Hierons, RM
Krinke, J
Publication Date: 2003
Publisher: IEEE
Citation: IEEE Conference on Software Maintenance and Reengineering (CSMR 2003), Benevento, pp. 363-367, Mar 2003
Abstract: Many approaches to slicing rely upon the 'fact' that the union of two static slices is a valid slice. It is known that static slices constructed using program dependence graph algorithms are valid slices (Reps and Yang, 1988). However, this is not true for other forms of slicing. For example, it has been established that the union of two dynamic slices is not necessarily a valid dynamic slice (Hall, 1995). In this paper this result is extended to show that the union of two static slices is not necessarily a valid slice, based on Weiser's definition of a (static) slice. We also analyse the properties that make the union of different forms of slices a valid slice.
URI: http://bura.brunel.ac.uk/handle/2438/3395
DOI: http://dx.doi.org/10.1109/CSMR.2003.1192445
Appears in Collections:B-SERC Research Papers
Computer Science
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Unions of slices are not slices.pdf119.38 kBAdobe PDFView/Open

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