Validating Halstead's Theory for Pascal Programs

Authors:
L. Felician;G. Zalateu
Affiliations:
-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1989

Citing 6
Cited 2

A Review and Evaluation of Software Science

ACM Computing Surveys (CSUR)
Elements of Software Science (Operating and programming systems series)

Elements of Software Science (Operating and programming systems series)
Defining software science counting strategies

ACM SIGPLAN Notices
An investigation into the effects of the counting method used on software science measurements

ACM SIGPLAN Notices
Measuring commercial PL/I programs using Halstead's criteria

ACM SIGPLAN Notices
An independent test of the theory of software physics

ACM SIGPLAN Notices

Methodology for Validating Software Metrics

IEEE Transactions on Software Engineering
Analyzing software science data with partial repeatability

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (1981) first recognized the lack of operators due to the structure of this language and proposed a modification of Halstead's formula. The article 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.