Performance comparison of software complexity metrics in an open source project

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

Abstract

Software complexity measures are essential aspects of software engineering. Relatively few studies have been conducted to compare the performance of different complexity metrics. This paper describes an experimental investigation, which compares the performance of three different software complexity metrics; McCabe's cyclomatic complexity, Halstead's complexity measures and Douce's spatial complexity, by using data from an Open Source project Eclipse JDT. The results of this investigation indicate that in different situation these complexity metrics show different performance. However, Halstead's effort measure and Douce's spatial complexity are highly correlated, showing bigger correlation coefficient values. This leads us to suggest that because Halstead's complexity measure is more mature and has better supporting tools, it may be a good idea to replace Douce's spatial complexity metric with Halstead's effort measure in practice. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zhang, M., & Baddoo, N. (2007). Performance comparison of software complexity metrics in an open source project. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4764 LNCS, pp. 160–174). Springer Verlag. https://doi.org/10.1007/978-3-540-75381-0_15

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