A Complexity Measure Export

@article{citeulike:1804109, abstract = {This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.}, author = {Mccabe, T. J.}, booktitle = {Software Engineering, IEEE Transactions on}, citeulike-article-id = {1804109}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1702388}, journal = {Software Engineering, IEEE Transactions on}, keywords = {1976, complexity, programming}, number = {4}, pages = {308--320}, posted-at = {2008-06-18 13:10:41}, priority = {1}, title = {A Complexity Measure}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1702388}, volume = {SE-2}, year = {1976} }

TY - JOUR ID - citeulike:1804109 L3 - citeulike-article-id:1804109 N2 - This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program. IS - 4 JF - Software Engineering, IEEE Transactions on EP - 320 TI - A Complexity Measure VL - SE-2 T2 - Software Engineering, IEEE Transactions on SP - 308 KW - 1976 KW - complexity KW - programming AU - Mccabe, TJ PY - 1976/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1702388 ER -