Issue No. 12 - December (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.106989
<p>The authors attempt to formalize some properties which any reasonable control-flow complexity measure must satisfy. Since large programs are often built by sequencing and nesting of simpler constructs, the authors explore how control-flow complexity measures behave under such compositions. They analyze five existing control flow complexity measures-cyclomatic number, total adjusted complexity, scope ratio, MEBOW, and NPATH. The analysis reveals the strengths and weaknesses of these control flow complexity measures.</p>
control-flow complexity measure; sequencing; nesting; cyclomatic number; total adjusted complexity; scope ratio; MEBOW; NPATH; programming theory; software metrics
K. Lakshmanan, S. Jayaprakash and P. Sinha, "Properties of Control-Flow Complexity Measures," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 1289-1295, 1991.