ConSUS: A Scalable Approach to Conditioned Slicing

Authors:
M. Daoudi;L. Ouarbya;J. Howroyd;S. Danicic;M. Harman;C. Fox;M. P. Ward
Affiliations:
-;-;-;-;-;-;-
Venue:
WCRE '02 Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02)
Year:
2002

Citing 0
Cited 4

Syntax-Directed Amorphous Slicing

Automated Software Engineering
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
A unifying theory of control dependence and its application to arbitrary program structures

Theoretical Computer Science
Path-Sensitive backward slicing

SAS'12 Proceedings of the 19th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conditioned slicing can be applied to reverse engineeringproblems which involve the extraction of executablefragments of code in the context of some criteria of interest.This paper introduces ConSUS, a conditioner for the WideSpectrum Language, WSL. The symbolic executor of ConSUSprunes the symbolic execution paths, and its predicatereasoning system uses the FermaTsimplifytransforma-tion in place of a more conventional theorem prover. Weshow that this combination of pruning and simplification-as-reasoner leads to a more scalable approach to conditioning.