| 对程序复杂程度的定量度量方法的分析 |
| |
| 引用本文： | 成奋华. 对程序复杂程度的定量度量方法的分析[J]. 长沙民政职业技术学院学报, 2004, 11(1): 91-93 |
| |
| 作者姓名： | 成奋华 |
| |
| 作者单位： | 长沙民政职业技术学院,湖南,长沙,410004 |
| |
| 摘 要： | 软件复杂度是为了预测软件开发费用、开发周期、可靠性的模块内程序逻辑复杂性的度量方法。本文介绍了最常用的代码行度量法，Halstead方法和McCabe方法及其特点，讨论了它们的适用范围和可用性。
|
| 关 键 词： | 详细设计 代码行度量法 Halstead法 McCabe方法 定量度量 |
| 文章编号： | 1671-5136(2004)01-0091-04 |
| 修稿时间： | 2003-07-30 |
Analysis of the Quantitative Measure of the Complicate Degree of Programming |
| |
| Cheng Fen-hua. Analysis of the Quantitative Measure of the Complicate Degree of Programming[J]. Journal of Changsha Social Work College, 2004, 11(1): 91-93 |
| |
| Authors: | Cheng Fen-hua |
| |
| Abstract: | The complexity of software is a measure for program logic complexity in models,which could be used to predict its corresponding developing expense, its developing period and its reliability. This paper shows the pertinent measures for the typical approaches of software complexity, such as Code Lines Meascre, Halstead Complexity Measure and McCabe Complexity Measure, and discusses the range of their application and their availability as well. |
| |
| Keywords: | detailed design code a generous character method the method of Halstead the method of McCabe fixed amount generous character |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
