AN EMPIRICAL-STUDY OF A SYNTACTIC COMPLEXITY FAMILY

被引:65
作者
BASILI, VR
HUTCHENS, DH
机构
关键词
D O I
10.1109/TSE.1983.235431
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:664 / 672
页数:9
相关论文
共 25 条
  • [1] Basili V. R., 1975, IEEE Transactions on Software Engineering, VSE-1, P390, DOI 10.1109/TSE.1975.6312870
  • [2] BASILI VR, 1979, IEEE COMP, P21
  • [3] BASILI VR, 1981, IEEE T SOFTWARE ENG, V7
  • [4] BASILI VR, 1976, SIMPL T STRUCTURED P
  • [5] BASILI VR, 1980, 19TH P ACM NBS ANN T, P13
  • [6] BENYONTINKER G, 1979, OCT P WORKSH QUANT S, P117
  • [7] CARRIERE WM, 1979, DEV LOGISTICS SOFTWA
  • [8] PROGRAM COMPLEXITY AND PROGRAMMER PRODUCTIVITY
    CHEN, ET
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1978, 4 (03) : 187 - 194
  • [9] Conover William Jay., 1998, PRACTICAL NONPARAMET, V350
  • [10] MEASURING THE PSYCHOLOGICAL COMPLEXITY OF SOFTWARE MAINTENANCE TASKS WITH THE HALSTEAD AND MCCABE METRICS
    CURTIS, B
    SHEPPARD, SB
    MILLIMAN, P
    BORST, MA
    LOVE, T
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (02) : 96 - 104