Software salvaging and the call dominance tree

The main goal of reuse reengineering processes for existing software is to obtain reusable software modules by clustering old software components that implement functional or data abstractions. The first problem to solve in the functional abstraction is how to search old software for components that...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software 1995-02, Vol.28 (2), p.117-127
Main Authors: Cimitile, A., Visaggio, G.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Criteria
Engineering
Exact sciences and technology
Information retrieval. Graph
Modular
Software
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The main goal of reuse reengineering processes for existing software is to obtain reusable software modules by clustering old software components that implement functional or data abstractions. The first problem to solve in the functional abstraction is how to search old software for components that may constitute a module. This article proposes candidature criteria founded on the dominance relation between the nodes of a call-directed graph. The proposed criteria have been adopted in a real-life reuse reengineering process on PASCAL software.
ISSN:0164-1212
1873-1228
DOI:10.1016/0164-1212(94)00049-S