Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
