This Article 
 Bibliographic References 
 Add to: 
Properties of Control-Flow Complexity Measures
December 1991 (vol. 17 no. 12)
pp. 1289-1295

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.

[1] A. L. Baker and S. H. Zweben, "A comparison of measures of control flow complexity,"IEEE Trans. Software Eng., vol. SE-6, no. 6, pp. 506-512, 1980.
[2] V. R. Basili and D. H. Hutchens, "An empirical study of a syntactic complexity family,"IEEE Trans. Software Eng., vol. SE-9, no. 6, pp. 664-672, 1983.
[3] J. S. David and R. J. LeBlanc, "A study of the applicability of complexity measures,"IEEE Trans. Software Eng., vol. 14, pp. 1366-1372, Sept. 1988.
[4] W. M. Evangelist, "Software complexity metric sensitivity to program structuring rules,"J. Syst. Software, vol. 3, pp. 231-243, 1982.
[5] N. E. Fenton and R. W. Whitty, "Axiomatic approach to software metrication through program decomposition,"Comput. J., vol. 29, no. 4, pp. 330-339, 1986.
[6] M. Halstead,Elements of Software Science. New York: Elsevier-North Holland, 1977.
[7] W. Harrison, K. I. Magel, R. Kluczny, and A. Dekock, "Applying software complexity metrics to program maintenance,"Computer, vol. 15, no. 9, pp. 65-79, 1982.
[8] S. Jayaprakash, K. B. Lakshmanan, and P. K. Sinha, "MEBOW: a comprehensive measure of control flow complexity," inProc. COMPSAC'87(Tokyo, Japan), Oct. 7-9, 1987, pp. 238-244.
[9] J. K. Kearney, R. L. Sedlmeyer, W. B. Thompson, M. A. Gray, and M. A. Adler, "Software complexity measurement,"Commun. ACM, vol. 29, no. 11, pp. 1044-1050, Nov. 1986.
[10] T. J. McCabe, "A complexity measure,"IEEE Trans. Software Eng., vol. SE-2, no. 4, pp. 308-320, 1976.
[11] G. J. Myers, "An extension to the cyclomatic measure of program complexity,"SIGPLAN Notices, vol. 12, no. 10, pp. 61-64, 1977.
[12] B. A. Nejmeh, "NPATH: a measure of execution path complexity and its applications,"Commun. ACM, vol. 31, no. 2, pp. 188-200, 1988.
[13] G. Oulsnam, "Cyclomatic numbers do not measure complexity of unstructured program,"Inform. Process. Lett., vol. 9, no. 5, pp. 207-211, 1979.
[14] E. I. Oviedo, "Control flow, data flow and program complexity," inProc. COMPSAC'80(Chicago, IL), Oct. 27-31, 1980, pp. 146-152.
[15] P. Piwowarski, "A nesting level complexity measure,"ACM SIGPLAN Notices, vol. 17, no. 9, pp. 44-50, 1982.
[16] R. E. Prather, "An axiomatic theory of software complexity measure,"Comput. J., vol. 27, no. 4, pp. 340-347, 1984.
[17] P. K. Sinha, S. Jayaprakash, and K. B. Lakshmanan, "A new look at the control flow complexity of computer programs," inSoftware Engineering'86, D. J. Barnes and P. J. Brown, Eds. London: Peter Peregrinus Ltd, 1986, pp. 88-102.
[18] E. J. Weyuker, "Evaluating software complexity measures,"IEEE Trans. Software Eng., vol. 14, pp. 1357-1365, Sept. 1988.
[19] M. R. Woodward, M. A. Hennell, and D. Hedley, "A measure of control flow complexity in program text,"IEEE Trans. Software Eng., vol. SE-5, no. 1, pp. 45-50, 1979.

Index Terms:
control-flow complexity measure; sequencing; nesting; cyclomatic number; total adjusted complexity; scope ratio; MEBOW; NPATH; programming theory; software metrics
K.B. Lakshmanan, S. Jayaprakash, P.K. Sinha, "Properties of Control-Flow Complexity Measures," IEEE Transactions on Software Engineering, vol. 17, no. 12, pp. 1289-1295, Dec. 1991, doi:10.1109/32.106989
Usage of this product signifies your acceptance of the Terms of Use.