A STUDY OF THE APPLICABILITY OF COMPLEXITY-MEASURES

被引：60

作者：

DAVIS, JS ^{[1
]}

LEBLANC, RJ ^{[1
]}

机构：

[1] GEORGIA INST TECHNOL,SCH INFORMAT & COMP SCI,ATLANTA,GA 30332

来源：

关键词：

PROGRAM PARTITION - PROGRAM SYNTAX COMPLEXITY - SOFTWARE COMPLEXITY MEASURES - SOFTWARE METRICS - SOFTWARE SCIENCE;

D O I：

10.1109/32.6179

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：1366 / 1372

页数：7

共 42 条

ADELSON, B .

[2]

ATWOOD M, 1979, ARI392 REP

[3] AN EMPIRICAL-STUDY OF A SYNTACTIC COMPLEXITY FAMILY [J].

BASILI, VR ;

HUTCHENS, DH .

[4]

BASILI VR, 1980, TUTORIAL MODELS METR

[5]

Bastani F. B., 1983, Proceedings COMPSAC 83: The IEEE Computer Society's Seventh International Computer Software and Applications Conference, P1

[6]

BELADY LA, 1980, IBM SYST J, V19

[7] TOWARDS A THEORY OF COGNITIVE-PROCESSES IN COMPUTER PROGRAMMING [J].

BROOKS, R .

INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES, 1977, 9 (06) :737-751

BROOKS, RE .

[9]

CLARKE LA, 1985, 8TH P INT C SOFTW EN

[10]

CONTE S, 1984, DAAG2982K0071 PURD R