面向C程序的环形复杂度自动化计算方法  

Automatic Calculation Method of Ring Complexity for C Program

作　　者：秦振华 牟永敏[1] QIN Zhenhua;MU Yongmin(School of Computer,Beijing Information Science and Technology University,Beijing 100101,China)

机构地区：[1]北京信息科技大学计算机学院,北京100101

出　　处：《计算机工程》2018年第12期102-107,114,共7页Computer Engineering

基　　金：国家自然科学基金(61370129);北京市自然科学基金(Z160002);网络文化与数字传播北京市重点实验室开放课题(5221735410);北京信息科技大学研究生教育基金(5121723403)

摘　　要：为准确度量软件复杂程度,提出一种环形复杂度计算方法。借助于Mc Cabe度量法,针对C语言程序,通过对源程序进行预处理,提取其中含有控制流信息的关键语句后对其进行分情况处理,从而无须借助控制流图即可实现程序环形复杂度的自动化计算。实验结果表明,该方法可以准确、高效地计算出程序的环形复杂度。In order to accurately measure the complexity of software,this paper proposes a calculation method of ring complexity.With the help of McCabe metric method,aiming at C language program,by preprocessing the source program,the key statements which contain the control flow information is extracted.The key sentences are processed separately so as to realize the automatic calculation of program ring complexity,and do not need to use the Control Flow Graph(CFG).Experimental results show that the method is feasible and can calculate the ring complexity of the program accurately and efficiently.

关 键 词：McCabe度量法 控制流图 环形复杂度 复合条件 自动化计算 

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