2013 20th Working Conference on Reverse Engineering (WCRE) (2002)
Oct. 29, 2002 to Nov. 1, 2002
One approach to reverse engineering is to partially automate sub component 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 sub components. This paper introduces a unification of slicing and concept assignment which exploits their combined advantages, while over coming 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 conc ept assignment and algorithms for each. The applic ationof the concept slicing algorithms is illustrated with a case study from a large financial organisation.
N. Gold, D. Binkley, M. Harman, R. Hierons, "Code Extraction Algorithms which Unify Slicing and Concept Assignment", 2013 20th Working Conference on Reverse Engineering (WCRE), vol. 00, no. , pp. 0011, 2002, doi:10.1109/WCRE.2002.1173060