Title :
Measuring dynamic program complexity
Author :
Munson, John C. ; Khoshgoftaar, Taghi M.
Author_Institution :
CS Div., Univ. of West Florida, Pensacola, FL, USA
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.<>
Keywords :
computational complexity; programming theory; complexity metrics; computer program; dynamic program complexity; functional complexity; linear compound metric; program performance prediction; program reliability; relative complexity; Application software; Costs; Mathematical model; Petroleum; Predictive models; Q measurement; Runtime; Software metrics; Taxonomy; Time measurement;
Journal_Title :
Software, IEEE
