loading...
On Modeling Software Architecture Recovery as Graph Matching
Amsterdam, The Netherlands September 22-September 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSM.2003.123542519th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kamran Sartipi, University of Waterloo
Kostas Kontogiannis, University of Waterloo
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both the software system and its high-level view, known as the conceptual architecture. Modeling the recovery process as graph matching is an attempt to identify a sub-optimal transformation from a pattern graph, representing the high-level view of the system, onto a subgraph of the software system graph. A successful match yields a restructured system that conforms with the given pattern graph. A failed match indicates the points where the system violates specific constraints. The pattern graph generation and the incrementality of the recovery process are the important issues to be addressed. The approach is evaluated through case studies using a prototype toolkit that implements the proposed interactive recovery environment.
Citation:
Kamran Sartipi, Kostas Kontogiannis, "On Modeling Software Architecture Recovery as Graph Matching," icsm, pp.224, 19th IEEE International Conference on Software Maintenance (ICSM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.