%0 Journal Article
%J Information Sciences
%D 1994
%T Measuring prime program complexity
%A Zelkowitz, Marvin V
%A Tian,Jianhui
%X This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity. This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative terms, and empirical means can be used to validate the assumptions used to develop the model. As a graph-based model, it can be applied to several graphical examples as extensions not otherwise available to source-code based models. This paper introduces the measure, derives several properties for it, and gives some simple examples to demonstrate that the measure is a plausible approximation of our notions concerning structured programming.
%B Information Sciences
%V 77
%P 325 - 350
%8 1994/03//
%@ 0020-0255
%G eng
%U http://www.sciencedirect.com/science/article/pii/0020025594900078
%N 3–4
%R 10.1016/0020-0255(94)90007-8