An information theory based complexity measure

  • Authors:
  • Eli Berlinger

  • Affiliations:
  • Nassau Community College, Garden City, New York

  • Venue:
  • AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

There have been numerous measures proposed to measure program complexity. Some are completely heuristic, comparing certain measurable program features against a set of predefined standards. Some are topological, based on the number of regions on the control or data graph of the programs or a combination of the above, and of course, there is Halstead's Software Physics.