arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.4523cs.SE
收藏

软件复杂性度量的相关性及实例分析

The Correlation among Software Complexity Metrics with Case Study

Yahya Tashtoush, Mohammed Al-Maolegi, Bassam Arkok

摘要:

人们对软件质量的要求越来越高,因此不同规模的软件都在快速增长,以处理软件的质量问题。软件复杂性度量是利用软件的一些内部属性或特征来了解它们对软件质量的影响的度量之一。在本文中,我们涵盖了一些更有效的软件复杂性度量,如圈复杂性,代码行和Hallstead复杂性度量。本文介绍了它们对软件质量的影响。并对两者之间的相关性进行了探讨和分析。最后以一个真实数据集为例,揭示了它们与错误数的关系。

英文摘要:

People demand for software quality is growing increasingly, thus different scales for the software are growing fast to handle the quality of software. The software complexity metric is one of the measurements that use some of the internal attributes or characteristics of software to know how they effect on the software quality. In this paper, we cover some of more efficient software complexity metrics such as Cyclomatic complexity, line of code and Hallstead complexity metric. This paper presents their impacts on the software quality. It also discusses and analyzes the correlation between them. It finally reveals their relation with the number of errors using a real dataset as a case study.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑