Code Extraction Algorithms which Unify Slicing and Concept Assignment

Authors:
M. Harman;N. Gold;R. Hierons;D. Binkley
Affiliations:
-;-;-;-
Venue:
WCRE '02 Proceedings of the Ninth Working Conference on Reverse Engineering (WCRE'02)
Year:
2002

Citing 0
Cited 12

Syntax-Directed Amorphous Slicing

Automated Software Engineering
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
Source Code Analysis: A Road Map

FOSE '07 2007 Future of Software Engineering
An empirical study of the relationship between the concepts expressed in source code and dependence

Journal of Systems and Software
Computing dynamic clusters

Proceedings of the 2nd India software engineering conference
Assessing the impact of global variables on program dependence and dependence clusters

Journal of Systems and Software
Automatic generation of abstract views for legacy software comprehension

Proceedings of the 3rd India software engineering conference
Program transformations for information personalization

Computer Languages, Systems and Structures
Towards automatically generating summary comments for Java methods

Proceedings of the IEEE/ACM international conference on Automated software engineering
Identifying services from legacy batch applications

Proceedings of the 5th India Software Engineering Conference
Integrating information retrieval, execution and link analysis algorithms to improve feature location in software

Empirical Software Engineering
Combining concern input with program analysis for bloat detection

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One approach to reverse engineering is to partially automate sub component extraction, improvement and subsequent recombination. Two previouslyproposed automated techniques for supporting thisactivity are slicing and concept assignment. However, neither is directly applicable in isolation; slicingcriteria (sets of program variables) are simply too lowlevel in many cases, while concept assignment typically fails to produce executable sub components.This paper introduces a unification of slicing andconcept assignment which exploits their combined advantages, while over coming their individual weaknesses. Our 'concept slices' are extracted usinghigh level criteria, while producing executable subprograms. The paper introduces three ways of combining slicing and conc ept assignment and algorithmsfor each. The applic ationof the concept slicing algorithms is illustrated with a case study from a largefinancial organisation.