DocumentCode
1198112
Title
Measuring dynamic program complexity
Author
Munson, John C. ; Khoshgoftaar, Taghi M.
Author_Institution
CS Div., Univ. of West Florida, Pensacola, FL, USA
Volume
9
Issue
6
fYear
1992
Firstpage
48
Lastpage
55
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;
fLanguage
English
Journal_Title
Software, IEEE
Publisher
ieee
ISSN
0740-7459
Type
jour
DOI
10.1109/52.168858
Filename
168858
Link To Document