A Pattern Matching Framework for Software Architecture Recovery and Restructuring

Authors:
Kamran Sartipi;Kostas Kontogiannis;Farhad Mavaddat
Affiliations:
-;-;-
Venue:
IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
Year:
2000

Citing 0
Cited 8

A Graph Pattern Matching Approach to Software Architecture Recovery

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Revisiting the ΔIC approach to component recovery

Science of Computer Programming - Software analysis, evolution and re-engineering
Architecture Reconstruction

Software Engineering
Extending the reflexion method for consolidating software variants into product lines

Software Quality Control
An Efficient Migration to Model-driven Development (MDD)

Electronic Notes in Theoretical Computer Science (ENTCS)
A biting-down approach to hierarchical decomposition of object-oriented systems based on structure analysis

Journal of Software Maintenance and Evolution: Research and Practice
Static analysis based software architecture recovery

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Comparison and evaluation of source code mining tools and techniques: A qualitative approach

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a framework for software architecture recovery and restructuring. The user specifies a high-level abstraction view of the system using a structured pattern language. A pattern-matching engine provides an optimal match between the given pattern and a decomposition of the legacy system entities by satisfying the inter/intra-module constraints defined in the pattern.The data mining technique Apriori is used by the matching engine to reveal meaningful data and control flow properties of the target system and limit the search space. A branch and bound search algorithm using a score function, models the constraints in the pattern as a Valued Constraint Satisfaction Problem (VCSP), and assists in searching for an optimal match between the given pattern and the target system.