|
|||||
|
|
| 路径复杂性度量研究 | |
| 引用本文： | 伦立军,丁雪梅,李英梅. 路径复杂性度量研究[J]. 计算机应用与软件, 2004, 21(4): 18-19,24 |
| 作者姓名： | 伦立军 丁雪梅 李英梅 |
| 作者单位： | 哈尔滨师范大学计算机科学系,哈尔滨,150080;哈尔滨师范大学计算机科学系,哈尔滨,150080;哈尔滨师范大学计算机科学系,哈尔滨,150080 |
| 基金项目： | 黑龙江省教育厅科技项目 (项目编号 :1 0 51 30 1 1 ) |
| 摘 要： | 软件复杂性度量是对程序静态特性和动态行为的理解难易程度的描述。本文通过分析传统的程序复杂性度量方法的不足之处，提出了一种新的路径复杂性度量方法及计算路径复杂度的算法，并给出了实例。新的度量方法比传统的度量方法更精确和容易实现。 |
| 关 键 词： | 软件度量 路径复杂性 结构复杂性 控制流图 |
RESEARCH OF PATH COMPLEXITY MEASUREMENT |
|
| Lun Lijun Ding Xuemei Li Yingmei. RESEARCH OF PATH COMPLEXITY MEASUREMENT[J]. Computer Applications and Software, 2004, 21(4): 18-19,24 | |
| Authors: | Lun Lijun Ding Xuemei Li Yingmei |
| Abstract: | Software complexity measure describes the complexity to understand the dynamic behavior and the static property of a program.This paper analyses the shortcoming of the traditional methods in program complexity measure,present a new measure method of the path complexity and the algorithm of computing path complexity measure,an example is given in this paper.This new measurement method is more accurate and easier to be realized than traditional methods. |
| Keywords: | Software metric Path complexity Structure complexity Control flow graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |