Content area

Abstract

The basic idea of Halstead's (1977) theory was to distinguish the operators and the operands inside a program written in any programming language. Johnston and Lister (1981) observed that Halstead's relation underestimated the program length, particularly with programs written in such highly structured languages as PASCAL. Johnston and Lister noticed a lack of operators resulting from the structure of this language, and they proposed a modification to Halstead's formula. In an experiment, an examination was made of approximately 550 PASCAL programs in the data processing center of the University of Udine. The results represent the widest test of Halstead's theory with regard to PASCAL programs. The experiment confirmed the results of Johnston and Lister but suggested a correction to their formula. This correction is particularly necessary for large programs.

Details

10000008
Business indexing term
Title
Validating Halstead's Theory for PASCAL Programs
Publication title
Volume
15
Issue
12
Pages
1630-1632
Number of pages
3
Publication year
1989
Publication date
Dec 1989
Publisher
IEEE Computer Society
Place of publication
New York
Country of publication
United States
Publication subject
ISSN
00985589
e-ISSN
19393520
CODEN
IESEDJ
Source type
Scholarly Journal
Language of publication
English
Document type
PERIODICAL
Accession number
00478255
ProQuest document ID
195592886
Document URL
https://www.proquest.com/scholarly-journals/validating-halsteads-theory-pascal-programs/docview/195592886/se-2?accountid=208611
Copyright
Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 1989
Last updated
2024-12-02
Database
ProQuest One Academic