Toward a theoretical basis for estimating programming effort

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Toward a theoretical basis for estimating programming effort

Full text

Pdf (156 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1975 annual conference table of contents

Pages: 222 - 224

Year of Publication: 1975

Author

M. H. Halstead

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800181.810326 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rose, Ida, "Programming Productivity", (With the proper reference lost in antiquity, this information passed from one computer center manager to another during the 1950's).
	2	Edsger W. Dijkstra, The humble programmer, Communications of the ACM, v.15 n.10, p.859-866, Oct. 1972 [doi>10.1145/355604.361591]
	3	M. H. Halstead, Natural laws controlling algorithm structure?, ACM SIGPLAN Notices, v.7 n.2, p.19-26, February 1972 [doi>10.1145/953363.953366]
	4	Maurice Halstead , Rudolf Bayer, Algorithm dynamics, Proceedings of the annual conference, p.126-135, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805693]
	5	Necdet Bulut , M. H. Halstead , Rudolf Bayer, Experimental validation of a structural property of fortran algorithms, Proceedings of the 1974 annual conference, p.207-211, January 1974 [doi>10.1145/800182.810404]
	6	Necdet Bulut, Invariant properties of algorithms., 1973
	7	Halstead, M. H., "Software Physics Comparison of a Sample Program in DSL ALPHA and COBOL", IBM Research Report R. J. 1460, October, 1974.
	8	Zislis, Paul, "An Experiment in Algorithm Implementation", CSD Tech. Rpt. No. 96, Purdue, June, 1973.
	9	Stroud, John M., "The Fine Structure of Psychological Time", Annals of the New York Academy of Sciences, 1966, pp. 623-631.
	10	Halstead, M. H., "A Theoretical Relationship Between Mental Work and Machine Language Programming", CSD Tech. Rpt. No. 67, Purdue, May, 1972.
	11	A. Beam, Algorithms 13: complex exponential integral, Communications of the ACM, v.3 n.7, p.406, July 1960 [doi>10.1145/367349.367351]
	12	Bohrer, Robert, "Halstead's Criterion and Statistical Algorithms", Proc. 8th Computer Science/Statistics Interface Symposium, Feb. 1975. Los Angeles.

CITED BY 4

	Siba N. Mohanty, Models and Measurements for Quality Assessment of Software, ACM Computing Surveys (CSUR), v.11 n.3, p.251-275, Sept. 1979
	Wilfred J. Hansen, Measurement of program complexity by the pair: (Cyclomatic Number, Operator Count), ACM SIGPLAN Notices, v.13 n.3, p.29-33, March 1978
	B. W. Boehm, Software engineering, Classics in software engineering, Yourdon Press, Upper Saddle River, NJ, 1979
	R. D. Gordon , M. H. Halstead, An experiment comparing Fortran programming times with the software physics hypothesis, Proceedings of the June 7-10, 1976, national computer conference and exposition, June 07-10, 1976, New York, New York