On Modeling Software Architecture Recovery as Graph Matching

  • Authors:
  • Kamran Sartipi;Kostas Kontogiannis

  • Affiliations:
  • -;-

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

Quantified Score

Hi-index 0.03

Visualization

Abstract

This paper presents a graph matching model for thesoftware architecture recovery problem. Because of theirexpressiveness, the graphs have been widely used forrepresenting both the software system and its high-levelview, known as the conceptual architecture. Modelingthe recovery process as graph matching is an attemptto identify a sub-optimal transformation from a patterngraph, representing the high-level view of the system, ontoa subgraph of the software system graph. A successfulmatch yields a restructured system that conforms withthe given pattern graph. A failed match indicates thepoints where the system violates specific constraints. Thepattern graph generation and the incrementality of therecovery process are the important issues to be addressed.The approach is evaluated through case studies using aprototype toolkit that implements the proposed interactiverecovery environment.