Paper Info
Title
An experimental study of two graph analysis based component capture methods for object-oriented systems
Abstract
The problem of how to partition a software system and thus capture its overall architecture and its constituent components has become a research focus in the community of software engineering. In the literature, many methods have been proposed for solving this problem. For example, both top-down and bottom-up methods based on analyzing the graph representation of software systems have been proposed. We report an experimental study of a top-down method and a bottom-up method. In our study, we focus on the capability of component capture, the capability of architecture recovery and the time complexity for the two methods. According to our results on two real world systems, the studied bottom-up method is superior to the studied top-down method in both aspects, although the time complexity of the bottom-up method remains a big concern for large systems.
Year
DOI
Venue
2004
10.1109/ICSM.2004.1357824
ICSM
Keywords
Field
DocType
overall architecture,time complexity,big concern,object-oriented system,research focus,graph representation,top-down method,graph analysis based component capture method,computational complexity,software architecture,bottom-up method,object-oriented programming,data flow analysis,component capture methods,graph theory,object-oriented systems,architecture recovery,experimental study,graph analysis,software engineering,software system,object oriented programming,bottom up,top down,software systems
Graph theory,Object-oriented programming,Computer science,Data-flow analysis,Theoretical computer science,Software system,Software architecture,Time complexity,Graph (abstract data type),Computational complexity theory
Conference
ISSN
ISBN
Citations 
1063-6773
0-7695-2213-0
6
PageRank 
References 
Authors
0.57
9
5
Name
Order
Citations
PageRank
Jing Luo1211.72
Renkuan Jiang260.57
Lingming Zhang32726154.39
Hong Mei43535219.36
Jiasu Sun569432.02