loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Conference on Software Maintenance (ICSM'03)
Software Architecture Recovery based on Pattern Matching
Amsterdam, The Netherlands
September 22-September 26
ISBN: 0-7695-1905-9
Kamran Sartipi, University of Waterloo
This paper is a summary of the author's thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined architectural patterns and graph matching techniques. In the proposed model, a high-level view of a software system in terms of the system components and their interactions is represented as a query, using a description language. A query is mapped onto a pattern-graph, where a component and its interactions with other components are represented as a group of graph-nodes and a group of graph-edges, respectively. Interaction constraints can be modeled by the description language as a part of the query. Such a pattern-graph is applied against an entity-relation graph that represents the information extracted from the source code of the software system. An approximate graph matching process performs a series of graph transformation operations (i.e., node/edge insertion/deletion) on the pattern-graph and uses a ranking mechanism based on data mining association to obtain a sub-optimal solution. The obtained solution corresponds to an extracted architecture that complies with the given query.
Citation:
Kamran Sartipi, "Software Architecture Recovery based on Pattern Matching," icsm, pp.293, 19th IEEE International Conference on Software Maintenance (ICSM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.