A precise method for identifying reusable abstract data types in code
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 404-413
- https://doi.org/10.1109/icsm.1994.336754
Abstract
This paper presents the results of research within the RE/sup 2/ project of a refinement of two existing methods for identifying reusable abstract data types. These methods are based on the relationships existing between the user defined types and procedure-like components that use them in their headings and on direct dominance trees and strong direct dominance trees that are refinements of the call directed graph of a program. It shows how these methods can be used to give a more precise set of reusable abstract data types. The method is then applied to a program and the results are compared with the existing method.<>Keywords
This publication has 5 references indexed in Scilit:
- Experiments in identifying reusable abstract data types in program codePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extracting abstract data types from C programs: A case studyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A reverse engineering method for identifying reusable abstract data typesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Software salvaging and the call dominance treeJournal of Systems and Software, 1995
- Reuse reengineering and validation via concept assignmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993