The Community for Technology Leaders
2013 20th Working Conference on Reverse Engineering (WCRE) (2001)
Suttgart, Germany
Oct. 2, 2001 to Oct. 5, 2001
ISSN: 1095-1350
ISBN: 0-7695-1303-4
pp: 25
Mark Harman , Brunel University
John Howroyd , University of London
Sebastian Danicic , University of London
Chris Fox , University of London
Mike Laurence , University of London
Rob Hierons , Brunel University
ABSTRACT
Several approaches to reverse and re-engineering are based upon program slicing. Unfortunately, for large systems, such as those which typically form the subject of reverse engineering activities, the space and time requirements of slicing can be a barrier to successful application.Faced with this problem, several authors have found it helpful to merge Control Flow Graph (CFG) nodes, thereby improving the space and time requirements of standard slicing algorithms. The node-merging process essentially creates a `coarser' version of the original CFG.This paper introduces a theory for defining Control Flow Graph node coarsening calculi. The theory formalizes properties of interest, when coarsening is used as a precursor to program slicing. The theory is illustrated with a case study of a coarsening calculus, which is proved to have the desired properties of sharpness and consistency.
INDEX TERMS
slicing, slice precision, node merging
CITATION
Mark Harman, John Howroyd, Sebastian Danicic, Chris Fox, Mike Laurence, Rob Hierons, "Node Coarsening Calculi for Program Slicing", 2013 20th Working Conference on Reverse Engineering (WCRE), vol. 00, no. , pp. 25, 2001, doi:10.1109/WCRE.2001.957807
85 ms
(Ver 3.3 (11022016))