CO4 3SQUnited Kingdom

Keywords: Conditioned Slicing, FermaT, Program Comprehension. Abstract Conditioned slicing can be applied to reverse engineer-ing problems which involve the extraction of executable fragments of code in the context of some criteria of interest.This paper introduces ConSUS, a conditioner for the Wide Spectrum Language, WSL. The symbolic executor of Con-SUS prunes the symbolic execution paths, and its predicate reasoning system uses the FermaT simplify transforma-tion in place of a more conventional theorem prover. We show that this combination of pruning and simplification-as-reasoner leads to a more scalable approach to conditioning