A FORMAL PROGRAM COMPLEXITY MODEL AND ITS APPLICATION

被引：25

作者：

TIAN, JH

ZELKOWITZ, MV

机构：

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

[2] UNIV MARYLAND,INST ADV COMP STUDIES,COLLEGE PK,MD 20742

来源：

JOURNAL OF SYSTEMS AND SOFTWARE | 1992年 / 17卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0164-1212(92)90114-Y

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This article takes an axiomatic approach to defining program complexity using complexity rankings and measures. A complexity ranking is an abstract, qualitative comparison between programs that is approximated by a complexity measure on each program. A set of axioms are stated and a classification scheme is presented with properties of each class. This is extended a series of properties developed by Weyuker. The formal model has many applications, including evaluating and classifying existing complexity measures and serving as criteria for complexity measure selection.

引用

页码：253 / 266

页数：14

共 24 条

[1]

ADAMOV R, 1990, J SYST SOFTWARE, V10, P55

[2]

AHO AV, 1988, COMPILERS PRINCIPLES, P159

[3] SOFTWARE FUNCTION, SOURCE LINES OF CODE, AND DEVELOPMENT EFFORT PREDICTION - A SOFTWARE SCIENCE VALIDATION [J].