Halstead复杂性度量与其他软件度量的相关性分析

Rodrigo Tavares Coimbra, Antônio Resende, Ricardo Terra
{"title":"Halstead复杂性度量与其他软件度量的相关性分析","authors":"Rodrigo Tavares Coimbra, Antônio Resende, Ricardo Terra","doi":"10.1109/CLEI.2018.00014","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":379986,"journal":{"name":"2018 XLIV Latin American Computer Conference (CLEI)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Correlation Analysis between Halstead Complexity Measures and other Software Measures\",\"authors\":\"Rodrigo Tavares Coimbra, Antônio Resende, Ricardo Terra\",\"doi\":\"10.1109/CLEI.2018.00014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":379986,\"journal\":{\"name\":\"2018 XLIV Latin American Computer Conference (CLEI)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 XLIV Latin American Computer Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2018.00014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 XLIV Latin American Computer Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2018.00014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

1977年提出的Halstead复杂性度量,基于运算符和操作数的度量数,独立于其底层编程语言(技术)来分析软件系统。从这两个度量中,它计算其他度量,即词汇量、长度、容量、难度、编程工作、错误和测试时间。然而,问题是,从那时起,学术界和工业界已经提出了数百个在断言和计算上不同的新指标。因此,本文的目的是通过对97个开源Java系统的检查,提出11个Halstead度量与过去几十年来提出的其他27个流行度量(例如LOC、圈复杂度和发出耦合)之间的相关性分析,以便(i)识别度量中的冗余,(ii)最小化监视和诊断软件项目的成本,促进进行度量的任务。因此,我们确定了Halstead度量和其他度量之间的强相关性,主要与大小相关,例如方法、包、属性等的数量。我们还确定了Halstead测量值与传入和传出耦合(Afferent and Efferent coupling)的直接相关性,其值范围为0.802至0.931,非常接近相关性的最大值1。这些结果表明,尽管没有完美的相关性,但有足够的相关性来假设,具有不同名称的测量存在重叠,其测量结果是等效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Correlation Analysis between Halstead Complexity Measures and other Software Measures
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data Quality Measurement Framework A Chatterbot Sensitive to Student's Context to Help on Software Engineering Education Quality Assessment of Awareness Support in Agile Collaborative Tools Digital Recording of Temporal Sequences of Images Applied to the Analysis of the Phenological Evolution of Maize Crops Ludic Practices to Support the Development of Software Engineering Educational Games: A Systematic Review
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1