CHARACTERISTICS OF CLASS COLLABORATION NETWORKS IN LARGE JAVA']JAVA SOFTWARE PROJECTS

被引:5
作者
Savic, Milos [1 ]
Ivanovic, Mirjana [1 ]
Radovanovic, Milos [1 ]
机构
[1] Univ Novi Sad, Fac Sci, Dept Math & Informat, Novi Sad 21000, Serbia
来源
INFORMATION TECHNOLOGY AND CONTROL | 2011年 / 40卷 / 01期
关键词
collaboration network; !text type='Java']Java[!/text; scale-free; small-world; software evolution; SCALE-FREE;
D O I
10.5755/j01.itc.40.1.192
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Understanding software structural complexity and evolution plays an important role in controlling the software development and maintenance process. Recent studies have shown that the theory behind complex networks, especially the theory of scale-free networks, can be a useful approach to the analysis of concrete software systems. In this paper, class collaboration networks associated with five large Java software systems (JDK, Ant, Tomcat, Lucene and JavaCC) are analyzed in order to determine whether they belong to the class of scale-free networks, and examine their small-world characteristics. For each analyzed network, we detected (approximately) scale-free and (ultra) small-world properties. The results indicate that general conclusions from scale-free network theory can be applied to Java software systems in order to understand their structural complexity and model software evolution at the structural (class collaboration) level. Moreover, we examine class collaboration network evolution of Ant, in order to check the preferential attachment hypothesis of the Barabasi-Albert model. For several major Ant network transitions we conclude that preferential attachment can successfully model Ant evolution at the class collaboration level. Finally, we discuss the implications of our results on software engineering, in several aspects: identification of important classes/interfaces, software testing strategy, and efficient communication among software entities.
引用
收藏
页码:48 / 58
页数:11
相关论文
共 21 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]  
[Anonymous], P 6 INT C COMPL SYST
[3]  
[Anonymous], 2007, DYNAM CONT DIS SER B
[4]  
[Anonymous], 2007, DYNAM CONT DIS SER B
[5]   Scale-free networks are ultrasmall [J].
Cohen, R ;
Havlin, S .
PHYSICAL REVIEW LETTERS, 2003, 90 (05) :4
[6]   Signatures of small-world and scale-free properties in large computer programs [J].
de Moura, APS ;
Lai, YC ;
Motter, AE .
PHYSICAL REVIEW E, 2003, 68 (01) :4-171024
[7]   SOFTWARE STRUCTURE METRICS BASED ON INFORMATION-FLOW [J].
HENRY, S ;
KAFURA, D .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1981, 7 (05) :510-518
[8]  
HYLANDWOOD D, 2006, TRMS1286 U MAR COLL
[9]  
*JAVACC, 2010, JAV JAVACC HOM
[10]  
JUNG, 2010, JUNG JAV UN NETW GRA