检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾一[1] 柴艳欣[1] 吴光金 程全良[1] 王艳丽[1] 李娟[1]
机构地区:[1]重庆大学计算机学院,重庆400030 [2]重庆农村商业银行科技信息部,重庆400020
出 处:《计算机工程与应用》2010年第12期64-67,71,共5页Computer Engineering and Applications
摘 要:简要分析了已有的几种面向对象软件复杂性度量方法,指出了这些方法在反映类复杂性方面存在的不足,运用软件复杂性分解的思想,提出了一种新的类复杂性度量方法。该方法将类复杂性分解为类成员复杂性、类成员关系复杂性和封装复杂性三个复杂性分量,对各分量分别度量,进而得出总复杂性。其中,类成员复杂性采用类所实现的成员的复杂性SIMC、类接口复杂性之和SCIC反映;类成员关系复杂性通过对文中提出的伪二部图进行分析反映;封装复杂性采用成员可见率反映。最后,通过实例验证了该方法的有效性和可行性。This paper analyzes several measure methods of object-oriented software complexity that have already existed,and points out their deficiencies of reflecting class complexity,and then proposes a new measure method of class complexity under the direction of software complexity decomposition.This method decomposes class complexity into three subsections—class member complexity,class member relation complexity and encapsulation complexity.Measure method for each subsection is proposed respectively,and then obtains the whole complexity.Here,class complexity is reflected by Sum of Implemented Method Complexity (SIMC) and Sum of Class Interface Complexity(SCIC);class member relation complexity is expressed by analysis of fake bipartite graph which is proposed in the paper;encapsulation complexity is expressed by visible rate of the member.At last,the rationality and feasibility of this method are validated from the application.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.17.179.20