Citations:
Access Restricted.
View access options
Article
Publication date: 1 February 1986
S. SITHARAMA IYENGAR, JOHN FULLER, SIDARTH AMBARDAR and N. PARAMESWARAN
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…
43
Abstract
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.