Toward a theoretical basis for estimating programming effort

Authors:
M. H. Halstead
Affiliations:
-
Venue:
ACM '75 Proceedings of the 1975 annual conference
Year:
1975

Citing 6
Cited 6

The humble programmer

Communications of the ACM
Algorithms 13: complex exponential integral

Communications of the ACM
Algorithm dynamics

ACM '73 Proceedings of the ACM annual conference
Experimental validation of a structural property of fortran algorithms

ACM '74 Proceedings of the 1974 annual conference - Volume 1
Invariant properties of algorithms.

Invariant properties of algorithms.
Natural laws controlling algorithm structure?

ACM SIGPLAN Notices

Models and Measurements for Quality Assessment of Software

ACM Computing Surveys (CSUR)
Measurement of program complexity by the pair: (Cyclomatic Number, Operator Count)

ACM SIGPLAN Notices
Software engineering

Classics in software engineering
Software Engineering

IEEE Transactions on Computers
An experiment comparing Fortran programming times with the software physics hypothesis

AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Architecture analysis of enterprise systems modifiability: a metamodel for software change cost estimation

Software Quality Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

The measurement of static properties of small algorithms yield data which, when combined with suitable assumptions, provide an equation for estimating the time required to program them. This equation, which contains no arbitrary constants, is tested against a small data sample, and the results do not invalidate the hypothesis.