AN ENTROPY-BASED MEASURE OF SOFTWARE COMPLEXITY

被引:81
作者
HARRISON, W
机构
[1] PSU Center for Software Quality Research, Portland State University, Portland, OR
关键词
INFORMATION THEORY; SOFTWARE METRICS; SOFTWARE PROJECT MANAGEMENT; SOFTWARE QUALITY;
D O I
10.1109/32.177371
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many different methods have been suggested for measuring "Software Complexity." In this paper, it is proposed that the complexity of a program is inversely proportional to the average information content of its operators. An empirical probability distribution of the operators occurring in a program is constructed and the classical entropy calculation applied: H = - SIGMAp(i) log2p(i). The performance of this metric is assessed in the analysis of two commercial applications totalling well over 130 000 lines of code. The results suggest the new metric does a good job of associating modules with their error spans (average number of tokens between error occurrences).
引用
收藏
页码:1025 / 1029
页数:5
相关论文
共 9 条
[1]  
BERLINGER E, 1980 P NAT COMP C, P773
[2]  
COOK C, 1991, 3RD P ANN OR WORKSH
[3]   A STUDY OF THE APPLICABILITY OF COMPLEXITY-MEASURES [J].
DAVIS, JS ;
LEBLANC, RJ .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (09) :1366-1372
[4]  
HALSTEAD M, 1976, ELEMENTS SOFTWARE SC
[5]  
HAMMING R, 1980, CODING INFORMATION T
[6]  
HARRISON W, 1982, IEEE COMPUTER SEP, P65
[7]   EVALUATING SOFTWARE COMPLEXITY-MEASURES [J].
WEYUKER, EJ .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (09) :1357-1365
[8]  
Zuse H., 1991, SOFTWARE COMPLEXITY, DOI [10.1515/9783110866087, DOI 10.1515/9783110866087]
[9]   FREQUENCY-DISTRIBUTION OF OPERATORS IN PL-I PROGRAMS [J].
ZWEBEN, SH ;
HALSTEAD, MH .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (02) :91-95