Fox, Chris; Danicic, Sebastian; Harman, Mark and Hierons, Robert. 2004. ConSIT: a fully automated conditioned program slicer. Software--Practice and Experience, 34(1), pp. 15-46. ISSN 0038-0644 [Article]

No full text available

Abstract or Description

Conditioned slicing is a source code extraction technique. The extraction is performed with respect to a slicing criterion which contains a set of variables and conditions of interest. Conditioned slicing removes the parts of the original program which cannot affect the variables at the point of interest, when the conditions are satisfied. This produces a conditioned slice, which preserves the behaviour of the original with respect to the slicing criterion.

Conditioned slicing has applications in source code comprehension, reuse, restructuring and testing. Unfortunately, implementation is not straightforward because the full exploitation of conditions requires the combination of symbolic execution, theorem proving and traditional static slicing. Hitherto, this difficultly has hindered development of fully automated conditioning slicing tools.

This paper describes the first fully automated conditioned slicing system, CONSIT, detailing the theory that underlies it, its architecture and the way it combines symbolic execution, theorem proving and slicing technologies. The use of CONSIT is illustrated with respect to the applications of testing and comprehension.

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

Edit Record (login required)