×

A comparison of a new measure of logical complexity of programs with the Halstead and McCabe methods. (English) Zbl 0591.68020

Summary: A comparison of the Halstead and McCabe methods of measuring program complexity with a recently proposed metric, which is based on the analysis of dependency computations using a data flowgraph model, is presented. The sensitivity of the metric to changes in the data structure is discussed. Comments and criticisms of the measures are included.

MSC:

68Q60 Specification and verification (program logics, model checking, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Iyengar S. S., J. Comp. Languages 7 (4) (1982)
[2] DOI: 10.1145/359810.359816 · Zbl 0355.68037 · doi:10.1145/359810.359816
[3] DOI: 10.1109/TSE.1979.234165 · Zbl 0395.68035 · doi:10.1109/TSE.1979.234165
[4] Chapin N., Proc. AFIPS 1979 National Computer Conf. 48 (AFIPS Press pp 48– (1979)
[5] DOI: 10.1109/TSE.1976.233837 · Zbl 0352.68066 · doi:10.1109/TSE.1976.233837
[6] DOI: 10.1145/947864.947869 · doi:10.1145/947864.947869
[7] DOI: 10.1109/TSE.1980.230799 · Zbl 0446.68018 · doi:10.1109/TSE.1980.230799
[8] Halstead M. H., Elements of Software Science (1977) · Zbl 0381.68007
[9] DOI: 10.1145/956003.956006 · doi:10.1145/956003.956006
[10] DOI: 10.1109/TSE.1979.234163 · Zbl 0394.68011 · doi:10.1109/TSE.1979.234163
[11] DOI: 10.1145/954373.954375 · doi:10.1145/954373.954375
[12] Feuer A. R., Proc. AFIPS 1979 National Computer Conf. 48 (AFIPS Press pp 1003–
[13] DOI: 10.1145/356715.356717 · doi:10.1145/356715.356717
[14] DOI: 10.1145/356744.356751 · doi:10.1145/356744.356751
[15] DOI: 10.1145/356778.356784 · doi:10.1145/356778.356784
[16] Hammer P. G., Proc. 6th Intl. Conf. (1982)
[17] S. Cater, S. S. Iyengar and J. Fuller, ”Algorithms to Compute Logical Effort in Programs” Technical Report (in preparation). Dept. of Computer Science, Louisiana State University (1982).
[18] DOI: 10.1109/TSE.1979.226497 · Zbl 0393.68017 · doi:10.1109/TSE.1979.226497
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.