Skip to main content
SpringerLink
Log in

Properties of software measures

  • Papers
  • Published:
Software Quality Journal Aims and scope Submit manuscript

Abstract

During recent years much attention has been directed towards the measurement of the properties and the complexity of software. The major goal of using software measures is to get reliable software and an objective representation of the properties of software and the software development process by numbers. Many software measures have been developed in order to determine the static complexity of single programs (intra-modular complexity) and of entire software systems (inter-modular complexity) during the phases of the software lifecycle. As a consequence of these developments many authors have discussed the properties of software measures. In this paper a measurement theory is introduced which gives conditions for the properties of measures. The properties of software measures and conditions of the use of software measures as an ordinal and ratio scale are given. As an example, these are applied to the measures of McCabe.

Because composition and decomposition operations are major strategies in software development, theorems which describe the properties of software measures related to this type of operations are also presented. Properties of software measures, as required by masses in the literature, are discussed and explained with statements of measurement theory. The results show that it is possible to explain most of the required properties of software measures in the literature with conditions of measurement theory. This makes the properties of software measures during the software lifecycle and their application in practice more visible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baili, V.R., Reiter, R. (1979) Evaluating automatable measures of software development, inProceedings of Workshop on Quantitative Software Models, pp. 107–116.

  • Bollmann, P. (1984) Two axioms for evaluation measures in information retrieval, inResearch and Development in Information Retrieval, ACM, British Computer Society Workshop Series, pp. 233–246.

  • Bollmann, P. and Zuse, H. (1987) An Axiomatic Approach to Software Complexity Measures, inProceedings of Third Symposium on Empirical Foundations of Information and Software Science III. Edited by Rasmussen, J. and Zunde, P. (eds), Plenum Press, New York Roskilde, Denmark, October 21–24, 1985.

    Google Scholar 

  • Card, D.N. and Glass, R.L. (1990)Measuring Software Design Quality, Prentice Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  • Conte, S.D., Dunsmore, H.E. and Shen, V.Y. (1986)Software Engineering Metrics and Model, Benjamin/Cummings Publishing Company, Menlo Park.

    Google Scholar 

  • Ejiogu, L. (1991)Software Engineering with Formal Metrics, QED Technical Publishing Group.

  • Fenton, N. (1991)Software Metrics — A Rigorous Approach, Chapman & Hall, London.

    Google Scholar 

  • Gustafson, D.A. and Prasad, B. (1992) Properties of software measures, inFormal Aspects of Measurement.Proceedings of the International BCS-FACS Workshop, London, 3 May 1991. Denvir, T., Herman, R. and Whitty, R. (eds), Springer-Verlag, London.

    Google Scholar 

  • Halstead, M.H. (1977)Elements of Software Science, Elsevier North-Holland, New York.

    Google Scholar 

  • Hansen, W. (1978) Measuring program complexity by the pair (cyclomatic number, operators count),ACM SIGPLAN Notices,13, 19–33.

    Google Scholar 

  • Harrison, W., Mangel, K., Kluczny, R. and DeKock, A. (1982) Applying software complexity metrics to program maintenance,Computer, 15 (9), 65–79.

    Google Scholar 

  • Henry, S., Kafura, D., Mayo, K., Yerneni, A. and Wake, S. (1988) A reliability model incorporating software quality factors, TR 88-45, Department of Computer Science, Virginia Polytechnic, Blacksbury, Virginia, USA.

    Google Scholar 

  • IEEE (1988)IEEE Sd 982.1-1988: Standard Dictionary of Metrics to Produce Reliable Software. The Institute of Electrical and Electronics Engineers, Inc 345 East 47th Street, New York, NY 10017-2394, USA IEEE Standard Board.

    Google Scholar 

  • Kearney, J.K., Sedlmeyer, R.L. and Thompson, W. (1986) Software complexity measurement,Communications of the ACM,29(11), 687–708.

    Article  Google Scholar 

  • Krantz, D.H., Luce, R.D., Suppes, P. and Tversky, A. (1971)Foundations of Measurement, Vol. 1, Academic Press, San Diego.

    Google Scholar 

  • Lakshmanan, K.B., Jayaprakash, S. and Sinha, P.K. (1991) Properties of control-flow complexity measures,IEEE Transactions on Software Engineering,17(12), 1289–1295.

    Article  Google Scholar 

  • Li, H.F. and Cheung, W.K. (1987) An empirical study of software metrics,IEEE Transactions on Software Engineering,Se-13.

  • Luce, R.D., Krantz, D.H., Suppes, P. and Tversky, A. (1990)Foundations of Measurement, Vol. 3, Academic Press, San Diego.

    Google Scholar 

  • Mayrhauser, A. von (1990)Software Engineering — Methods and Management, Academic Press, San Diego.

    Google Scholar 

  • McCabe, T. (1976) A complexity measure,IEEE Transactions of Software Engineering,SE-1(3), 312–327.

    Google Scholar 

  • Page-Jones, M. (1988)The Practical Guide to Structured Systems, Second Edition, Yourdon Pres.

  • Prather, R.E. (1984) An axiomatic theory of software complexity measure,The Computer Journal,27(4), 340–347.

    Article  MathSciNet  Google Scholar 

  • Pressmann, R.S. (1987)Software Engineering: A Practitioner's Approach, Second Edition, McGraw Hill.

  • Roberts, F.S. (1979) Measurement theory with applications to decisionmaking, utility, and the social sciences,Encyclopedia of Mathematics and its Applications, Addison Wesley Publishing Company.

  • Shooman, M.L. (1983)Software Engineering, McGraw Hill.

  • Weyuker, E.J. (1985) Evaluating software complexity measures, Technical Report No 149, Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, N.Y. 10012.

    Google Scholar 

  • Weyuker, E.J. (1988) Evaluating software complexity measures,IEEE Transactions of Software Engineering,14(9).

  • Zuse, H. (1985) Meßtheoretische Analyse von statischen Softwarekomplexitätsmaßen, TU-Berlin 1985, Fachbereich Informatik, Dissertation im FB 20 (PhD Thesis).

  • Zuse, H. (1991)Software Complexity — Measures and Methods, DeGruyter Publisher, Berlin, New York.

    Google Scholar 

  • Zuse, H. and Bollmann, P. (1989) Using measurement theory to describe the properties and scales of static software complexity metrics,SIGPLAN Notices,24(8), 23–33.

    Google Scholar 

  • Zuse, H., Bollmann-Sdorra, P. (1992) Measurement theory and software measures, inFormal Aspects of Measurement Proceedings of the International BCS-FACS Workshop, Denvir, T., Herman, R. and Whitty, R. (eds), 3 May 1991, London, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin (FR 5-3), 1 Berlin 10, Germany

    Horst Zuse

Authors
  1. Horst Zuse
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zuse, H. Properties of software measures. Software Qual J 1, 225–260 (1992). https://doi.org/10.1007/BF01885772

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01885772

Keywords

Search

Navigation