A large number of real networks are characterized by two fundamental properties: they are small world and scale-free. A recent paper demonstrated that the structure of many complex networks is also self-similar under a length-scale transformation, and calculated their fractal dimension using the "box counting" method. We studied nine large object-oriented software systems, finding that the graphs associated to these networks are self-similar. We also studied the time evolution of the fractal dimension during system growth, finding a significant correlation between the fractal dimension and object-oriented complexity metrics known to be correlated with software fault-proneness. Thus, in software systems the fractal dimension could be considered as a measure of internal complexity, and consequently of the system quality.
[1]
Michele Marchesi,et al.
Power-Laws in a Large Object-Oriented Software System
,
2007,
IEEE Transactions on Software Engineering.
[2]
Sergi Valverde,et al.
Hierarchical Small Worlds in Software Architecture
,
2003
.
[3]
David J. Sheskin,et al.
Handbook of Parametric and Nonparametric Statistical Procedures
,
1997
.
[4]
R. Ferrer i Cancho,et al.
Scale-free networks from optimal design
,
2002,
cond-mat/0204344.
[5]
Maliha S. Nash,et al.
Handbook of Parametric and Nonparametric Statistical Procedures
,
2001,
Technometrics.