An axiomatic model for program complexity

  • Marvin V. Zelkowitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 706)


In this note we have proposed a set of axioms and a classification scheme that may be used to validate the effectiveness of proposed software productivity measures. We demonstrate the effectiveness of this model by applying a classification tree analysis for high cost modules on 16 NASA Software Engineering Laboratory projects and show that by prescreening the set of measures according to our axioms, we can improve upon the retrieval process.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Tian and M. V. Zelkowitz: A formal model of program complexity and its application. Journal of Systems and Software 17:3 253–266 (1992)Google Scholar
  2. 2.
    E. J. Weyuker: Evaluating Software Complexity Measures. IEEE Trans. on Software Engineering 14:9 1357–1365 (1988)Google Scholar
  3. 3.
    A. A. Porter and R. W. Selby: Empirically Guided Software Development Using Metric-Based Classification Trees. IEEE Software 7:2 46–54 (March, 1990)Google Scholar
  4. 4.
    J. Tian, A. Porter and M. V. Zelkowitz: An Improved Classification Tree Analysis of High Cost Modules Based Upon an Axiomatic Definition of Complexity. IEEE 3rd International Symposium on Software Reliability Engineering, Research Triangle Park, NC (October, 1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Marvin V. Zelkowitz
    • 1
  1. 1.Institute for Advanced Computer Studies and Department of Computer ScienceUniversity of MarylandCollege Park

Personalised recommendations