Proof Rules for the Programming Language Euclid

Download PDF
Open Webpage

Ralph L. London, John V. Guttag, James J. Horning, Butler W. Lampson, James G. Mitchell, Gerald J. Popek

Published: 1978, Last Modified: 25 Jan 2026Acta Informatica 1978EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In the spirit of the previous axiomatixation of the programming language Pascal, this paper describes Hoare-style proof rules for Euclid, a programming language intended for the expression of system programs which are to be verified. All constructs of Euclid are covered except for storage allocation and machine dependencies.