A CONDITIONED PROGRAM SLICER
Dr Chris Fox, Department of Computer Science, King's College London

Abstract: Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, re-engineering 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.

This paper introduces a conditional slicing system which is based upon conventional static slicing, symbolic execution and theorem proving. This is the first fully automated implementation of conditioned slicing.

This seminar was held at the Department of Computer Science, Royal Holloway, University of London on 16 October 2001.

back