Validating Halstead's Theory for PASCAL Programs
Guardado en:
| 發表在: | IEEE Transactions on Software Engineering vol. 15, no. 12 (Dec 1989), p. 1630-1632 |
|---|---|
| 主要作者: | |
| 其他作者: | |
| 出版: |
IEEE Computer Society
|
| 主題: | |
| 在線閱讀: | Citation/Abstract Full Text - PDF |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|
| Resumen: | 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. |
|---|---|
| ISSN: | 0098-5589 1939-3520 |
| DOI: | 10.1109/32.58773 |
| Fuente: | ABI/INFORM Global |