基于统计的程序大小估计

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference Pub Date : 1989-09-20 DOI:10.1109/CMPSAC.1989.65150

Muneo Takahashi, Takeshi Miyake, S. Hanata

{"title":"基于统计的程序大小估计","authors":"Muneo Takahashi, Takeshi Miyake, S. Hanata","doi":"10.1109/CMPSAC.1989.65150","DOIUrl":null,"url":null,"abstract":"A model for estimating program size, before coding of the program begins, on the basis of the complexity of the software is presented. The complexity of the software is computed from program logic charts with the Halstead metrics. The relationships between the complexity of the software and program size are then statistically analyzed by taking hypothesized environmental factors, such as program categories, into consideration. Results of an experiment show that, of the Halstead metrics, N/sub 1/ is the most significant and reasonable as a metric for computing the complexity of the software from program logic charts. The results also show that the model based on this metric is more reliable than the conventional size estimation method.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Statistically-based program size estimation\",\"authors\":\"Muneo Takahashi, Takeshi Miyake, S. Hanata\",\"doi\":\"10.1109/CMPSAC.1989.65150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A model for estimating program size, before coding of the program begins, on the basis of the complexity of the software is presented. The complexity of the software is computed from program logic charts with the Halstead metrics. The relationships between the complexity of the software and program size are then statistically analyzed by taking hypothesized environmental factors, such as program categories, into consideration. Results of an experiment show that, of the Halstead metrics, N/sub 1/ is the most significant and reasonable as a metric for computing the complexity of the software from program logic charts. The results also show that the model based on this metric is more reliable than the conventional size estimation method.<<ETX>>\",\"PeriodicalId\":339677,\"journal\":{\"name\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1989.65150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1989.65150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种基于软件复杂性，在程序开始编码前估算程序大小的模型。软件的复杂性是由程序逻辑图与霍尔斯特德度量计算。然后，通过考虑假设的环境因素(如程序类别)，对软件复杂性和程序大小之间的关系进行统计分析。实验结果表明，在Halstead度量中，N/sub 1/作为从程序逻辑图计算软件复杂性的度量是最重要和最合理的。结果还表明，基于该度量的模型比传统的尺寸估计方法更可靠

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Statistically-based program size estimation

A model for estimating program size, before coding of the program begins, on the basis of the complexity of the software is presented. The complexity of the software is computed from program logic charts with the Halstead metrics. The relationships between the complexity of the software and program size are then statistically analyzed by taking hypothesized environmental factors, such as program categories, into consideration. Results of an experiment show that, of the Halstead metrics, N/sub 1/ is the most significant and reasonable as a metric for computing the complexity of the software from program logic charts. The results also show that the model based on this metric is more reliable than the conventional size estimation method.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference

自引率

0.00%

发文量