EVALUATING SOFTWARE COMPLEXITY-MEASURES

被引：413
|
作者：
WEYUKER, EJ
机构：
[1] New York Univ, New York, NY, USA
来源：
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1988年 / 14卷 / 09期
关键词：
COMPUTER METATHEORY;
D O I：
10.1109/32.6178
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A set of properties of syntactic software complexity measures is proposed to serve as a basis for the evaluation of such measures. Four known complexity measures are evaluated and compared using these criteria. This formalized evaluation clarifies the strengths and weaknesses of the examined complexity measures, which include the statement count, cyclomatic number, effort measure, and data flow complexity measures. None of these measures possesses all nine properties, and several are found to fail to possess particularly fundamental properties; this failure calls into question their usefulness in measuring syntactic complexity.
引用
收藏
页码：1357 / 1365
页数：9
相关论文
共 50 条
  • [1] ON WEYUKER AXIOMS FOR SOFTWARE COMPLEXITY-MEASURES
    CHERNIAVSKY, JC
    SMITH, CH
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (06) : 636 - 638
  • [2] A FACTOR-ANALYSIS OF SOFTWARE COMPLEXITY-MEASURES
    MATATOLEDO, RA
    GUSTAFSON, DA
    JOURNAL OF SYSTEMS AND SOFTWARE, 1992, 17 (03) : 267 - 273
  • [3] A STUDY OF THE APPLICABILITY OF COMPLEXITY-MEASURES
    DAVIS, JS
    LEBLANC, RJ
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (09) : 1366 - 1372
  • [4] A COMPARATIVE CLASSIFICATION OF COMPLEXITY-MEASURES
    WACKERBAUER, R
    WITT, A
    ALTMANSPACHER, H
    KURTHS, J
    SCHEINGRABER, H
    CHAOS SOLITONS & FRACTALS, 1994, 4 (01) : 133 - 173
  • [5] COMPLEXITY-MEASURES FOR RANDOM KNOTS
    SUMNERS, DW
    COMPUTERS & CHEMISTRY, 1990, 14 (04): : 275 - 279
  • [6] COMBINED NETWORK COMPLEXITY-MEASURES
    HALL, NR
    PREISER, S
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1984, 28 (01) : 15 - 27
  • [7] 2 TYPES OF PROPERTIES FOR COMPLEXITY-MEASURES
    LISCHKE, G
    INFORMATION PROCESSING LETTERS, 1981, 12 (03) : 123 - 126
  • [8] COMPLEXITY-MEASURES ON SYSTEMS OF PARALLEL ALGORITHMS
    BURGIN, MS
    PROGRAMMING AND COMPUTER SOFTWARE, 1984, 10 (01) : 12 - 21
  • [9] PROPERTIES OF COMPLEXITY-MEASURES FOR PRAMS AND WRAMS
    BUBLITZ, S
    SCHURFELD, U
    VOIGT, B
    WEGENER, I
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 230 - 238
  • [10] UNIFORM CHARACTERIZATIONS OF NONUNIFORM COMPLEXITY-MEASURES
    BALCAZAR, JL
    DIAZ, J
    GABARRO, J
    INFORMATION AND CONTROL, 1985, 67 (1-3): : 53 - 69
12345