The Challenge of Software Complexity

Moore, Kevin and Wermelinger, Michel (2013). The Challenge of Software Complexity. In: Proceedings of the European Conference on Complex Systems 2012, pp. 179–187.

DOI: https://doi.org/10.1007/978-3-319-00395-5_27

Abstract

Given the interdisciplinary nature of complex network studies, there is a practical need for dialogue between theorists proposing graph measurements and those seeking to apply them into a domain. We consider this in the domain of software complexity by highlighting the distinctive nature of networks representing software’s internal structure and also by describing the application of one such proposal, the offdiagonal complexity, against two examples of software. The results showed the promise of using complex networks to measure software complexity but also demonstrated the confounding effects of size. Based on that application we make proposals to improve the dialogue between theory and experiment.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 38238
• Item Type
• Conference or Workshop Item
• ISSN
• 2213-8684
• Keywords
• Software complexity; Software evolution; Graph theory; Software metrics; Offdiagonal
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Research Group
• Centre for Research in Computing (CRC)
• Copyright Holders
• © 2013 Springer
• Depositing User
• Michel Wermelinger