Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3388
Title: Node coarsening calculi for program slicing
Authors: Harman, M
Hierons, RM
Danicic, S
Howroyd, J
Laurence, MR
Fox, C
Keywords: Slicing;Slice precision;Node merging
Issue Date: 2001
Publisher: IEEE
Citation: IEEE Working Conference on Reverse Engineering (WCRE'2001), Stuttgart, 25-34, Oct 2001
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. The 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.
URI: http://bura.brunel.ac.uk/handle/2438/3388
DOI: http://dx.doi.org/10.1109/WCRE.2001.957807
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Node coarsening calculi for program slicing.pdf826.64 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.