SIGN-IN

Publication: Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution

All || By Area || By Year

Title Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution
Authors/Editors* S. Jenkins and S.R. Kirk
Where published* Information Sciences
How published* Journal
Year* 2007
Volume 177
Number 12
Pages 2587-2601
Publisher Elsevier
Keywords Software metric; Lehman’s laws; Complexity; Scale-free; Directed network; Power law
Link
Abstract
The stability and evolution of the structure of consecutive versions of a series of software architecture graphs are analysed using the theory of complex networks. Brief comparisons are drawn between the scale-free behaviour and second order phase transitions. On this basis a software design metric Icc is proposed. This software metric is used to quantify the evolution of the stability vs. maintainability of the software through various releases. It is demonstrated that the classes in the software graph are acquiring more out-going calls than incoming calls as the software ages. Three examples of software applications where maintainability and continuous refactoring are an inherent part of their development process are presented, in addition to a Sun Java2 framework where growth and backward compatibility are the more important factors for the development. Further to this a projected future evolution of the software structure and maintainability is calculated. Suggestions for future applications to software engineering and the natural sciences are briefly presented.
Go to Computational Chemistry
Back to page 64 of list