Skip to main content

Abstract

Basic concepts of an axiomatic approach to measuremesnt theory are applied to software complexity measurement. In order to make valid statements regarding such measurements, one has to know whether the appropriate scale is ordinal, interval or ratio. Criteria are derived for the metric of McCabe on the basis of which one can determine which type of scale it represents. It is shown that the proposed method can be applied to other software complexity measures as well.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Basili, V., 1980, Tutorial on Models and Metrics for Software Management and Engineering, Computer Society Press, Catalog No. EHO-167–7, COMSAC 80.

    Google Scholar 

  • Bollmann, P., and Chierniavsky, V., 1981, “Measurement-Theoretical Investigation of the MZ-Metric”, Information Retrieval Research, Oddy, R. N., Robertson, S. E., van Rijsbergen, C. J., and Williams, P. W., eds., Butterworth.

    Google Scholar 

  • Bollman, P., 1984, “Two Axioms for Evaluation Measures in Information Retrieval”, Research and Development in Information Retrieval, ACM, British Computer Society Workshop Series, pp. 233–246.

    Google Scholar 

  • Cherniavsky, V., and Lakhuty, D. G., 1971, “On the Problem of Retrieval System Evaluation”, Nauchno -Tekhnicheskaja Informacija, 2, (9). (In Russian.)

    Google Scholar 

  • Curtis, B., 1979, “In Search of Software Complexity”, Workshop on Quantitative Software Models for Reliability, pp. 95–106.

    Google Scholar 

  • Harrison, W., Magel, K., Klucszny, R., and DeKock, A., 1982, “Applying Software Complexity Metrics to Maintenance”, Computer, 15, (9), pp. 65–79.

    Article  Google Scholar 

  • Krantz, D. H., Luce, R. D., Suppes, P., and Tversky, A., 1971, Foundations of Measurement, Academic Press.

    MATH  Google Scholar 

  • McCabe, T. J., 1976, “A Complexity Measure”, IEEE Transactions on Software Engineering, SE-2, (4), December, pp. 308–320.

    Article  MathSciNet  Google Scholar 

  • Prather, R. E., 1984, “An Axiomatic Theory of Software Complexity Measure”, The Computer Journal, 27, (4).

    Google Scholar 

  • Pressmann, R. S., 1982, Software Engineering: A Practitioner’s Approach McGraw Hill.

    Google Scholar 

  • Zuse, H., 1985, Messtheoretische Analyse von statischen Softwarekomplex-itätsmassen, TU-Berlin, Fachbereich Informatik. Dissertation im FB 20 (Ph.D. Thesis).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Bollmann, P., Zuse, H. (1987). An Axiomatic Approach to Software Complexity Measures. In: Rasmussen, J., Zunde, P. (eds) Empirical Foundations of Information and Software Science III. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1895-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1895-8_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9055-1

  • Online ISBN: 978-1-4613-1895-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics