Measuring Dynamic Program Complexity

  • Authors:
  • John C. Munson;Taghi M. Khoshgoftaar

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Software
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

A relative complexity technique that combines the features of many complexity metrics to predict performance and reliability of a computer program is presented. Relative complexity aggregates many similar metrics into a linear compound metric that describes a program. Since relative complexity is a static measure, it is expanded by measuring relative complexity over time to find a program's functional complexity. It is shown that relative complexity gives feedback on the same complexity domains that many other metrics do. Thus, developers can save time by choosing one metric to do the work of many.