ON WEYUKER AXIOMS FOR SOFTWARE COMPLEXITY-MEASURES

被引：38

作者：

CHERNIAVSKY, JC

SMITH, CH

机构：

[1] NBS,COMP SYST LAB,WASHINGTON,DC 20234

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

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

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1991年 / 17卷 / 06期

关键词：

D O I：

10.1109/32.87287

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Properties for software complexity measures are explored. It is shown that a collection of properties suggested by Weyuker are inadequate for determining the quality of a software complexity measure.

引用

页码：636 / 638

页数：3

共 12 条

[1]

BASILI V, 1979, P IEEE WORKSHOP QUAN

[2] ON SIZE OF MACHINES [J].

BLUM, M .

INFORMATION AND CONTROL, 1967, 11 (03) :257-&

[3] SIMPLE EXPERIMENT IN TOP-DOWN DESIGN [J].

COMER, D ;

HALSTEAD, MH .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (02) :105-109

[4] MEASURING THE PSYCHOLOGICAL COMPLEXITY OF SOFTWARE MAINTENANCE TASKS WITH THE HALSTEAD AND MCCABE METRICS [J].

CURTIS, B ;

SHEPPARD, SB ;

MILLIMAN, P ;

BORST, MA ;

LOVE, T .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (02) :96-104

[5]

Halstead M, 1977, ELEMENTS SOFTWARE SC

[6]

KRANTZ DH, 1971, F MEASUREMENT

[7]

McCabe T. J., 1976, IEEE Transactions on Software Engineering, VSE-2, P308, DOI 10.1109/TSE.1976.233837

[8]

OVIEDO EI, 1980, P IEEE COMPSAC CHIC, P146

[9] STRUCTURED TURING MACHINES [J].

PRATHER, RE .

INFORMATION AND CONTROL, 1977, 35 (02) :159-171

[10] DESIGN MEASUREMENT - SOME LESSONS LEARNED [J].

ROMBACH, HD .

IEEE SOFTWARE, 1990, 7 (02) :17-25

← 1 2 →