Title :
Properties of control-flow complexity measures
Author :
Lakshmanan, K.B. ; Jayaprakash, S. ; Sinha, P.K.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Brockport, NY, USA
fDate :
12/1/1991 12:00:00 AM
Abstract :
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
Keywords :
programming theory; software metrics; MEBOW; NPATH; control-flow complexity measure; cyclomatic number; nesting; scope ratio; sequencing; total adjusted complexity; Computer science; Flow graphs; Fluid flow measurement; Phase measurement; Size control; Size measurement; Software maintenance; Software measurement; Software metrics; Software testing;
Journal_Title :
Software Engineering, IEEE Transactions on
