@article {18415, title = {Program complexity using Hierarchical Abstract Computers}, journal = {Computer Languages}, volume = {13}, year = {1988}, month = {1988///}, pages = {109 - 123}, abstract = {A model of program complexity is introduced which combines structural control flow measures with data flow measures. This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer. It is shown that this measure is consistent with the ideas of information hiding and data abstraction. Because this measure is sensitive to the linear form of a program, it can be used to measure different concrete representations of the same algorithm, as in a structured and an unstructured version of the same program. Application of the measure as a model of system complexity is given for {\textquotedblleft}upstream{\textquotedblright} processes (e.g. specification and design phases) where there is no source program to measure by other techniques.}, keywords = {CASE tools, complexity, ENVIRONMENTS, measurement, Prime programs}, isbn = {0096-0551}, doi = {10.1016/0096-0551(88)90019-7}, url = {http://www.sciencedirect.com/science/article/pii/0096055188900197}, author = {Bail,William G and Zelkowitz, Marvin V} }