A Correlation Analysis between Halstead Complexity Measures and other Software Measures

被引:1
|
作者
Coimbra, Rodrigo Tavares [1 ]
de Resende, Antonio Maria P. [1 ]
Terra, Ricardo [1 ]
机构
[1] Univ Fed Lavras, Dept Ciencia Comp, Lavras, MG, Brazil
来源
2018 XLIV LATIN AMERICAN COMPUTER CONFERENCE (CLEI 2018) | 2018年
关键词
Metrics; software measures; Halstead; Correlation Analysis; METRICS;
D O I
10.1109/CLEI.2018.00014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Halstead Complexity Measures, proposed in 1977, analyze a software system independently of its underlying programming language (technology) based on the measures number of operators and operands. From these two measures, it calculates other measures namely vocabulary, length, volume, difficulty, programming effort, errors, and testing time. The problem, nevertheless, is that since then the Academy and Industry have been coming up with hundreds of new metrics that differ in their assertions and calculations. Therefore, the objective of this paper is to present a correlation analysis between the eleven Halstead measures and other 27 popular measures proposed over the decades (e.g., LOC, cyclomatic complexity, and efferent coupling) through the inspection of 97 open-source Java systems in order to (i) identify redundancy in measures and (ii) minimize the costs of monitoring and diagnosing software projects, facilitating the task of making measurements. As a result, we identified strong correlations between Halstead measures and other measures, mainly related to size such as quantity of methods, packages, attributes, etc. We also identified direct correlation of Halstead measurements with coupling measures named Afferent and Efferent Coupling, with values ranging from 0.802 to 0.931, which are quite close to the maximum value 1 for a correlation. These results demonstrate that-although there is no perfect correlation-there is enough correlation to hypothesize that there is an overlap of measures with different denominations whose measured results are equivalent.
引用
收藏
页码:31 / 39
页数:9
相关论文
共 50 条
  • [1] Complexity measures for software engineering
    Burgin, M.
    Debnath, N.
    JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2005, 5 (01) : S127 - S143
  • [2] Tighter Relations between Sensitivity and Other Complexity Measures
    Ambainis, Andris
    Bavarian, Mohammad
    Gao, Yihan
    Mao, Jieming
    Sun, Xiaoming
    Zuo, Song
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 101 - 113
  • [3] A FACTOR-ANALYSIS OF SOFTWARE COMPLEXITY-MEASURES
    MATATOLEDO, RA
    GUSTAFSON, DA
    JOURNAL OF SYSTEMS AND SOFTWARE, 1992, 17 (03) : 267 - 273
  • [4] EVALUATING SOFTWARE COMPLEXITY-MEASURES
    WEYUKER, EJ
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (09) : 1357 - 1365
  • [5] Impact of "Evaluating Software Complexity Measures"
    Weyuker, Elaine J.
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2025, 51 (03) : 732 - 736
  • [6] On the relationship between energy complexity and other boolean function measures
    Sun, Xiaoming
    Sun, Yuan
    Wu, Kewen
    Xia, Zhiyu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (05) : 1470 - 1492
  • [7] On the relationship between energy complexity and other boolean function measures
    Xiaoming Sun
    Yuan Sun
    Kewen Wu
    Zhiyu Xia
    Journal of Combinatorial Optimization, 2022, 43 : 1470 - 1492
  • [8] On the Relationship Between Energy Complexity and Other Boolean Function Measures
    Sun, Xiaoming
    Sun, Yuan
    Wu, Kewen
    Xia, Zhiyu
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 516 - 528
  • [9] Generalized kolmogorov complexity and other dual complexity measures
    Burgin, M.S.
    Cybernetics (English Translation of Kibernetika), 1991, 26 (04):