{"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}
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.<>