Axiomatic Definitions of Programming Languages

DOI10.1145/322307.322324MaRDI QIDQ3936170zbMATH OpenOpenAlexFDO

Authors Albert R. Meyer, Joseph Y. Halpern

Publication date 1982

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322307.322324

zbMATH Keywords

axiomatic semanticsfirst-order predicate calculuspartial correctness assertionsprogram scheme semanticstermination assertions

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(10)

• Inductive completeness of logics of programs
• Some applications of topology to program semantics
• A natural deduction approach to dynamic logic
• European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
• Distances between formal theories
• Differential game logic
• Reasoning in Dynamic Logic about Program Termination
• The axiomatic semantics of programs based on Hoare's logic
• Necessary and sufficient conditions for the universality of programming formalisms
• Equivalences among logics of programs

This page was built for publication: Axiomatic Definitions of Programming Languages

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