Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3389
Title: Code extraction algorithms which unify slicing and concept assignment
Authors: Harman, M
Gold, N
Hierons, RM
Binkley, D
Keywords: Slicing;Concept assignment;Source code extraction
Issue Date: 2002
Publisher: IEEE
Citation: Ninth Working Conference on Reverse Engineering (WCRE 2002), Richmond, pp. 11-21, Oct 2002
Abstract: One approach to reverse engineering is to partially automate subcomponent extraction, improvement and subsequent recombination. Two previously proposed automated techniques for supporting this activity are slicing and concept assignment. However, neither is directly applicable in isolation; slicing criteria (sets of program variables) are simply too low level in many cases, while concept assignment typically fails to produce executable subcomponents. This paper introduces a unification of slicing and concept assignment which exploits their combined advantages, while overcoming their individual weaknesses. Our 'concept slices' are extracted using high level criteria, while producing executable subprograms. The paper introduces three ways of combining slicing, and concept assignment and algorithms for each. The application of the concept slicing algorithms is illustrated with a case study from a large financial organisation.
URI: http://bura.brunel.ac.uk/handle/2438/3389
DOI: http://dx.doi.org/10.1109/WCRE.2002.1173060
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Code extraction algorithms which unify slicing and concept assignment.pdf394.28 kBAdobe PDFView/Open


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