Data Structures and Correctness of Programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data Structures and Correctness of Programs

Full text

Pdf (973 KB)

Source

Journal of the ACM (JACM) archive
Volume 26 , Issue 2 (April 1979) table of contents

Pages: 283 - 301

Year of Publication: 1979

ISSN:0004-5411

Author

Tomasz Kowaltowski

Departamento de Ciência da Computação, Universidade Estadual de Campinas, Caixa Postal 1170, 13100 Campinas, SP, Brazil and Universidade de São Paulo, São Paulo, Brazil

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 30, Citation Count: 3

Additional Information:

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/322123.322133 What is a DOI?

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	BURSTALL, R M Some techmques for proving correctness of programs which alter data structures. In Machine Intelhgence 7, D Mlchte, Ed, American Elsevier, New York, 1972, pp 23-50
	2	FLOYD, R W Assigning meanmgs to programs Proc Symp m Apphed Mathematics, Vol 19, J T Schwartz, EA, Amer Math Soc, Provtdence, R i, 1967, pp 19-32
	3	Donald Irvin Good, Toward a man-machine system for proving program correctness, 1970
	4	C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969 [doi>10.1145/363235.363259]
	5	James Cornelius King, A program verifier, 1970
	6	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	7	Tomasz Kowaltowski, Correctness of programs manipulating data structures., 1973
	8	MANNA, Z The correctness of programs J Comptr Syst $ct 3 (1969), 119-127
	9	MCCARTHY, J., AND PAINTER, J Correctness of a compiler for arithmetic expressmns Proc Symp m Applied Mathemattcs, Vol 19, J T Schwartz, Ed, Amer. Math Soc, Provtdence, R I, 1967, pp 33-41
	10	MORRIS, J H Verification-oriented language design Tech Rep No 7, Dept of Comptr Sct, U of Cahfornla, Berkeley, Cahf, 1972
	11	POUPON, J, AND WEGBREIT, B Covering functtons Center for Research m Computing Technology, Harvard U, Cambridge, Mass, 1972

CITED BY 3

	J. Hagelstein, Proving properties of shared data structures application to functional programming, Proceedings of the ACM '82 conference, p.142-148, January 1982
	Jacques Cohen, Garbage Collection of Linked Data Structures, ACM Computing Surveys (CSUR), v.13 n.3, p.341-367, Sept. 1981
	R. J. R. Back , Heikki Mannila , Kari-Jouko Räihä, Derivation of efficient DAG marking algorithms, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.20-27, January 24-26, 1983, Austin, Texas