Title :
A pattern matching framework for software architecture recovery and restructuring
Author :
Sartipi, Kamran ; Kontogiannis, Kostas ; Mavaddat, Farhad
Author_Institution :
Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
Abstract :
The 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/intramodule constraints defined by 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
Keywords :
constraint theory; data mining; pattern matching; software architecture; software maintenance; system recovery; tree searching; Apriori; VCSP; Valued Constraint Satisfaction Problem; branch and bound search algorithm; control flow properties; data mining technique; high level abstraction view; inter/intramodule constraints; legacy system entities; matching engine; meaningful data; optimal match; pattern matching engine; pattern matching framework; score function; search space; software architecture recovery; software restructuring; structured pattern language; target system; Computer architecture; Computer science; Concrete; Control systems; Data mining; Engines; Optimal matching; Pattern matching; Software architecture; Software maintenance;
Conference_Titel :
Program Comprehension, 2000. Proceedings. IWPC 2000. 8th International Workshop on
Conference_Location :
Limerick
Print_ISBN :
0-7695-0656-9
DOI :
10.1109/WPC.2000.852478
