This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Weyuker's Axioms for Software Complexity Measures
June 1991 (vol. 17 no. 6)
pp. 636-638

Properties for software complexity measures are discussed. It is shown that a collection of nine properties suggested by E.J. Weyuker is inadequate for determining the quality of a software complexity measure. A complexity measure which satisfies all nine of the properties, but which has absolutely no practical utility in measuring the complexity of a program is presented. It is concluded that satisfying all of the nine properties is a necessary, but not sufficient, condition for a good complexity measure.

[1] V. Basili and R. Reiter, "Evaluating automatable measures of software models," inProc. IEEE Workshop on Quantitative Software Models, 1979.
[2] M. Blum, "On the size of machines,"Inform. Contr., vol. 11, pp. 257-265, 1967.
[3] D. Comer and M. Halstead, "A simple experiment in top-down design,"IEEE Trans. Software Eng., vol. SE-5, pp. 105-109, Feb. 1979.
[4] W. Curtis, S. Sheppard, P. Milliman, M. Borst, and T. Love, "Measuring the psychological complexity of software maintenance tasks with the Halstead and McCabe metrics,"IEEE Trans. Software Eng., vol. SE-5, pp. 96-104, Feb. 1979.
[5] M. Halstead,Elements of Software Science. New York: Elsevier-North Holland, 1977.
[6] D. Krantz, R. Luce, P. Suppes, and A. Tversky,Foundations of Measurement. New York: Academic, 1971.
[7] T. J. McCabe, "A complexity measure,"IEEE Trans. Software Eng., vol. 2, pp. 308-320, Apr. 1976.
[8] E. I. Oviedo, "Control flow, data flow and program complexity," inProc. IEEE COMPSAC, pp. 146-152, 1980.
[9] R. E. Prather,"Structured turing machines,"Inform. Contr., vol. 35, pp. 159-171, 1977.
[10] H. D. Rombach, "Design measurement: some leasons learned,"IEEE Software, vol. 7, no. 2, pp. 17-25, 1990.
[11] E. J. Weyuker, "Evaluating software complexity measures,"IEEE Trans. Software Eng., vol. 14, pp. 1357-1365, Sept. 1988.
[12] H. Zuse and P. Bollmann, "Using measurment theory to describe the properties and scales of static software complexity metrics," IBM, IBM Res. Rep. RC 13504, 1987.

Index Terms:
software complexity measures; computational complexity; software metrics
Citation:
J.C. Cherniavsky, C.H. Smith, "On Weyuker's Axioms for Software Complexity Measures," IEEE Transactions on Software Engineering, vol. 17, no. 6, pp. 636-638, June 1991, doi:10.1109/32.87287
Usage of this product signifies your acceptance of the Terms of Use.