Skip to main content
SpringerLink
Log in
Book cover

Formal Aspects of Measurement pp 108–115Cite as

Complexity Measures on Trees

  • Conference paper

  • 41 Accesses

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

The work in [5] suggests a methodology for software measures research which emphasizes the interplay between a complexity measure and an order on a set of software documents. Frequently, this order is induced by a partial order on a set of abstractions of the set of documents, such as trees or flow graphs, and the complexity measure is induced by an order-preserving mapping on the set of abstractions. In a related vein, the work in [3], [4], and [6] has described specific complexity measures and suggested possible axioms which should be satisfied by any complexity measure.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel, J., Sur les operations definies pour nombres reels, Bull. Math. Soc. France, v. 76 (1949), 59–64.

    MathSciNet  Google Scholar 

  2. Fenton, N.E., Software Metrics - a rigorous approach, Van Nostrand Reinhold, 1991.

    Google Scholar 

  3. Fenton, N.E. and Whiny, R.W., Axiomatic approach to software metrication through program decomposition, Comput. J. 1986, 29, (4), 329–339.

    Article  Google Scholar 

  4. McCabe, T.J., A complexity measure, IEEE Trans. SE-2, 1976, (4), 308–320.

    Google Scholar 

  5. Melton, A.C., Gustafson, D.A., Bieman, J.M., and Baker, A.L., A mathematical perspective for software measures research, Software Engineering Journal, September, 1990, 246–254.

    Google Scholar 

  6. Prather, R.E., An axiomatic theory of software complexity measure, Comput. J., 27, (4), 340–347.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Wesleyan University, Middletown, CT, 06459, USA

    Michael D. Rice

Authors
  1. Michael D. Rice
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Translimina Ltd, 37 Orpington Road Winchmore Hill, N21 3PD, London, UK

    Tim Denvir MA, CEng, MIEE, MBCS

  2. Humanities Programme, Imperial College, 180 Queen’s Gate, SW7 2BZ, London, UK

    Rosalind Herman MA, MSc

  3. Centre for Systems and Software Engineering, South Bank University, 103 Borough Road, SE1 0AA, London, UK

    Robin W. Whitty BSc, PhD, C.Math, FIMA

Rights and permissions

Reprints and permissions

Copyright information

© 1992 British Computer Society

About this paper

Cite this paper

Rice, M.D. (1992). Complexity Measures on Trees. In: Denvir, T., Herman, R., Whitty, R.W. (eds) Formal Aspects of Measurement. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3205-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3205-9_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19788-1

  • Online ISBN: 978-1-4471-3205-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation