Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Software architecture graphs as complex networks: a novel partitioning scheme to measure stability and evolution
University West, Department of Technology, Mathematics and Computer Science, Division for Computer Science.ORCID iD: 0000-0002-4288-7653
University West, Department of Technology, Mathematics and Computer Science, Division for Computer Science.ORCID iD: 0000-0002-0462-6962
2007 (English)In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 177, no 12, p. 2587-2601Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2007. Vol. 177, no 12, p. 2587-2601
Keywords [en]
Software measurement, Software metric, Lehman’s laws, Complexity, Scale-free, Directed network, Power law
National Category
Information Systems
Research subject
Engineering, Computer engineering
Identifiers
URN: urn:nbn:se:hv:diva-130DOI: 10.1016/j.ins.2007.01.021OAI: oai:DiVA.org:hv-130DiVA, id: diva2:211478
Available from: 2009-04-15 Created: 2009-04-15 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Jenkins, SamanthaKirk, Steven

Search in DiVA

By author/editor
Jenkins, SamanthaKirk, Steven
By organisation
Division for Computer Science
In the same journal
Information Sciences
Information Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 360 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf