PROGRAM COMPLEXITY USING HIERARCHICAL ABSTRACT COMPUTERS

被引：4

作者：

BAIL, WG

ZELKOWITZ, MV

机构：

[1] UNIV MARYLAND,FACHBEREICH COMP SCI,COLLEGE PK,MD 20742

[2] NBS,INST COMP SCI & TECHNOL,GAITHERSBURG,MD 20899

来源：

COMPUTER LANGUAGES | 1988年 / 13卷 / 3-4期

基金：

美国国家航空航天局;

关键词：

Computer Software - Information Theory;

D O I：

10.1016/0096-0551(88)90019-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 'upstream' processes (e.g. specification and design phases) where there is no source program to measure by other techniques.

引用

页码：109 / 123

页数：15