VALIDATING HALSTEAD THEORY FOR PASCAL PROGRAMS

被引：3

作者：

FELICIAN, L ^{[1
]}

ZALATEU, G ^{[1
]}

机构：

[1] UNIV UDINE,DIPARTIMENTO MATEMAT & INFORMAT,I-33100 UDINE,ITALY

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1989年 / 15卷 / 12期

关键词：

Computer Programming Languages--PASCAL;

D O I：

10.1109/32.58773

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

M. H. Halstead's theory (1977) has been validated for different languages, but Pascal programs seem to fit only partially with the theory. D. B. Johnston and A. M. Lister (Software Practice and Experience, vol. II, 1981) first recognized the lack of operators due to the structure of this language and proposed a modification of Halstead's formula. This study confirms their results, but suggests a correction to their formula, which is particularly necessary for large programs. Experimental results, obtained by examining about 550 Pascal programs, represent the widest test to date of Halstead theory with regard to Pascal programs.

引用

页码：1630 / 1632

页数：3