This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Measuring Dynamic Program Complexity
November/December 1992 (vol. 9 no. 6)
pp. 48-55

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.

Index Terms:
program performance prediction; program reliability; dynamic program complexity; relative complexity; complexity metrics; computer program; linear compound metric; functional complexity; computational complexity; programming theory
Citation:
John C. Munson, Taghi M. Khoshgoftaar, "Measuring Dynamic Program Complexity," IEEE Software, vol. 9, no. 6, pp. 48-55, Nov.-Dec. 1992, doi:10.1109/52.168858
Usage of this product signifies your acceptance of the Terms of Use.