Computing cyclomatic complexity with cubic flowgraphs

作     者：Tang, Yongming Dogru, Ali H. Kurfess, Franz J. Tanik, Murat M. 

作者机构：School of Computer Science and Information Systems Fairleigh Dickinson University 1000 River Road T-BE2-01 Teaneck NJ 07666 United States Computer Engineering Department Middle East Technical University Ankara 06531 Turkey Computer Science Department Concordia University 1455 de Maisonneuve West Montreal Que. H3G 1M8 Canada Department of Electrical and Computer Engineering University of Alabama at Birmingham Birmingham AL 35294 United States 

出 版 物：《Journal of Systems Integration》 (J Syst Integr)

年 卷 期：2001年第10卷第4期

页      面：395-409页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Software engineering 

摘      要：Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building software by integration is a developing paradigm, especially enabled by the emerging component technologies. Decomposition of the design for a top-down approach is a prerequisite for this paradigm. Cubic flowgraphs are instrumental in providing formalisms for decomposition and integration. Cyclomatic complexity analysis of a design representation that is decomposable is the goal of this research. In addition to introducing cyclomatic complexity computation using cubic flowgraphs, preservation of cyclomatic complexity in the decomposition of the cubic flowgraph is also presented.