Toward a theoretical basis for estimating programming effort

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.