Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3385
Title: ConSIT: A conditioned program slicer
Authors: Danicic, S
Fox, C
Harman, M
Hierons, RM
Issue Date: 2000
Publisher: IEEE
Citation: IEEE International Conference on Software Maintenance (ICSM'2000), San Jose, pp. 216-226, Oct 2000
Abstract: Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering and program comprehension. However there has been relatively little work on the implementation of conditioned slicing. Algorithms for implementing conditioned slicing necessarily involve reasoning about the values of program predicates in certain sets of states derived from the conditioned slicing criterion, making implementation particularly demanding. The paper introduces ConSIT, a conditioned slicing system which is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing. An implementation of ConSIT is available for experimentation at &http://www.mcs.gold.ac.uk/tilde/~mas01sd/consit.html
URI: http://bura.brunel.ac.uk/handle/2438/3385
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
A conditioned program slicer.pdf906.56 kBAdobe PDFView/Open


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