Proof rules for the programming language Euclid

DOI10.1007/BF00260921MaRDI QIDQ1249430zbMATH OpenOpenAlexFDO

Authors John Guttag, J. J. Horning, Butler Lampson, J. G. Mitchell, Ralph L. London, Gerald J. Popek

Publication date 1978

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00260921

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(9)

• Fifty years of Hoare's logic
• Semantics of algorithmic languages
• Axiomatic semantics for escape statements
• Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles
• On removing the machine from the language
• Weakest preconditioned goto axiom
• The axiomatic semantics of programs based on Hoare's logic
• On the notion of expressiveness and the rule of adaptation
• A complete axiomatic semantics of spawning

This page was built for publication: Proof rules for the programming language Euclid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249430)