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.
Cite
CITATION STYLE
APA
Halstead, M. H. (1975). Toward a theoretical basis for estimating programming effort. In Proceedings of the 1975 Annual Conference, ACM 1975 (pp. 222–224). Association for Computing Machinery. https://doi.org/10.1145/800181.810326
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free