Skip Navigation


The Computer Journal Advance Access originally published online on July 22, 2005
The Computer Journal 2005 48(6):737-748; doi:10.1093/comjnl/bxh121
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
48/6/737    most recent
bxh121v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Danicic, S.
Right arrow Articles by Laurence, M. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas

Sebastian Danicic1, Chris Fox2, Mark Harman3, Rob Hierons4, John Howroyd5 and Michael R. Laurence6

1 Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK
2 Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK
3 Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK
4 School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, UK
5 @UK PLC, 5 Jupiter House, Calleva Park, Aldermaston, Berkshire RG7 8NN, UK
6 Department of Computer Science, University of Liverpool, Peach Street, Liverpool L69 3BX, UK

Email: S.Danicic{at}gold.ac.uk

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.