一种软件功能度量的公理方法

Yuan-Tsong Chen, M. Tanik
{"title":"一种软件功能度量的公理方法","authors":"Yuan-Tsong Chen, M. Tanik","doi":"10.1109/IWRSP.1992.243908","DOIUrl":null,"url":null,"abstract":"Three axioms for functional complexity of software are proposed. The first axiom asserts that functional complexity is a function and is computable at the specification level. The second axiom argues that an empty specification has zero functional complexity. The third axiom asserts that a harder specification has no less functional complexity than an easier one. With these three axioms and various definitions of the notions of functional complexity, a number of theorems are proved. Code metrics, including statement count, M. Halstead's (1977) programming effort, and T. McCabe's cyclomatic number are reviewed, together with specification metrics including L. Hellerman's (1972) metric, D. Schutt's (1977) metric, N. Coulter's (1987) metric, and A. Albrecht's (1983) functional point. These metrics are evaluated with respect to the three axioms. Results show that code metrics do not satisfy these axioms, while Hellerman, Schutt, and Coulter metrics do.<<ETX>>","PeriodicalId":210681,"journal":{"name":"[1992 Proceedings] The Third International Workshop on Rapid System Prototyping","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An axiomatic approach of software functionality measure\",\"authors\":\"Yuan-Tsong Chen, M. Tanik\",\"doi\":\"10.1109/IWRSP.1992.243908\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Three axioms for functional complexity of software are proposed. The first axiom asserts that functional complexity is a function and is computable at the specification level. The second axiom argues that an empty specification has zero functional complexity. The third axiom asserts that a harder specification has no less functional complexity than an easier one. With these three axioms and various definitions of the notions of functional complexity, a number of theorems are proved. Code metrics, including statement count, M. Halstead's (1977) programming effort, and T. McCabe's cyclomatic number are reviewed, together with specification metrics including L. Hellerman's (1972) metric, D. Schutt's (1977) metric, N. Coulter's (1987) metric, and A. Albrecht's (1983) functional point. These metrics are evaluated with respect to the three axioms. Results show that code metrics do not satisfy these axioms, while Hellerman, Schutt, and Coulter metrics do.<<ETX>>\",\"PeriodicalId\":210681,\"journal\":{\"name\":\"[1992 Proceedings] The Third International Workshop on Rapid System Prototyping\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992 Proceedings] The Third International Workshop on Rapid System Prototyping\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWRSP.1992.243908\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992 Proceedings] The Third International Workshop on Rapid System Prototyping","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWRSP.1992.243908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了软件功能复杂性的三个公理。第一个公理断言功能复杂性是一个函数,并且在规范级别上是可计算的。第二个公理认为,空规范具有零功能复杂性。第三个公理断言,较难的规范的功能复杂性并不比较容易的规范少。利用这三个公理和函数复杂性概念的各种定义,证明了许多定理。代码度量,包括语句计数、M. Halstead(1977)的编程努力和T. McCabe的圈数,以及规范度量,包括L. Hellerman(1972)度量、D. Schutt(1977)度量、N. Coulter(1987)度量和A. Albrecht(1983)功能点。这些度量是根据这三个公理来计算的。结果表明代码度量不满足这些公理,而Hellerman、Schutt和Coulter度量满足
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An axiomatic approach of software functionality measure
Three axioms for functional complexity of software are proposed. The first axiom asserts that functional complexity is a function and is computable at the specification level. The second axiom argues that an empty specification has zero functional complexity. The third axiom asserts that a harder specification has no less functional complexity than an easier one. With these three axioms and various definitions of the notions of functional complexity, a number of theorems are proved. Code metrics, including statement count, M. Halstead's (1977) programming effort, and T. McCabe's cyclomatic number are reviewed, together with specification metrics including L. Hellerman's (1972) metric, D. Schutt's (1977) metric, N. Coulter's (1987) metric, and A. Albrecht's (1983) functional point. These metrics are evaluated with respect to the three axioms. Results show that code metrics do not satisfy these axioms, while Hellerman, Schutt, and Coulter metrics do.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信