程序复杂性度量的一种新方法  

A New Method about the Complexity Metrics of Program

作　　者：伦立军[1] 丁雪梅[1] 李英梅[1] 

机构地区：[1]哈尔滨师范大学计算机科学系,黑龙江哈尔滨150080

出　　处：《计算机应用研究》2004年第2期37-39,共3页Application Research of Computers

基　　金：黑龙江省教育厅科技项目(10513011);哈尔滨师范大学杰出青年基金资助项目

摘　　要：通过分析传统的程序复杂性度量方法的不足之处,首先提出了一种基于程序分解机制的路径复杂性度量方法,然后给出了计算路径复杂度的算法,最后给出了实例。新的度量方法指出了一个程序需要的完全测试路径数目。Program complexity measure describes the complexity to understand the dynamic behavior and the static property of a program, it can be viewed as a mapping from the program system to the expression system.This paper analyses the shortcoming of the traditional methods in program complexity measure, a new methodology of measuring path complexity is proposed based on program decomposition mechanisms at first, then the algorithm of computing path complexity measure is given, finally an example is given in this paper.This new measurement method also points out that how many individual complete paths of a program need to be tested.

关 键 词：软件度量 路径复杂性 结构复杂性 控制流图 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]