The challenge of software complexity

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Moore, K., & Wermelinger, M. (2013). The challenge of software complexity. In Springer Proceedings in Complexity (pp. 179–187). Springer. https://doi.org/10.1007/978-3-319-00395-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free