To read the full version of this content please select one of the options below:

A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS

S. SITHARAMA IYENGAR (Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana (U.S.A.))
JOHN FULLER (Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana (U.S.A.))
SIDARTH AMBARDAR (Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana (U.S.A.))
N. PARAMESWARAN (Indian Institute of Technology, Bombay (India))

Kybernetes

ISSN: 0368-492X

Article publication date: 1 February 1986

39

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.

Citation

SITHARAMA IYENGAR, S., FULLER, J., AMBARDAR, S. and PARAMESWARAN, N. (1986), "A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS", Kybernetes, Vol. 15 No. 2, pp. 103-110. https://doi.org/10.1108/eb005735

Publisher

:

MCB UP Ltd

Copyright © 1986, MCB UP Limited

Related articles