Software Architecture Recovery based on Pattern Matching

  • Authors:
  • Kamran Sartipi

  • Affiliations:
  • -

  • Venue:
  • ICSM '03 Proceedings of the International Conference on Software Maintenance
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is a summary of the author's thesis thatpresents a model and an environment for recovering thehigh level design of legacy software systems based on userdefined architectural patterns and graph matching techniques.In the proposed model, a high-level view of a softwaresystem in terms of the system components and theirinteractions is represented as a query, using a descriptionlanguage. A query is mapped onto a pattern-graph, wherea component and its interactions with other componentsare represented as a group of graph-nodes and a group ofgraph-edges, respectively. Interaction constraints can bemodeled by the description language as a part of the query.Such a pattern-graph is applied against an entity-relationgraph that represents the information extracted from thesource code of the software system. An approximate graphmatching process performs a series of graph transformationoperations (i.e., node/edge insertion/deletion) on thepattern-graph and uses a ranking mechanism based on datamining association to obtain a sub-optimal solution. Theobtained solution corresponds to an extracted architecturethat complies with the given query.