Axiomatic Definitions of Programming Languages

DOI10.1145/322307.322324zbMath0478.68009OpenAlexW2087821987MaRDI QIDQ3936170

Joseph Y. Halpern, Albert R. Meyer

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 semanticspartial correctness assertionsfirst-order predicate calculustermination assertionsprogram scheme semantics

Mathematics Subject Classification ID

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

Related Items (10)

Differential Game Logic ⋮ DISTANCES BETWEEN FORMAL THEORIES ⋮ A natural deduction approach to dynamic logic ⋮ Some applications of topology to program semantics ⋮ Reasoning in Dynamic Logic about Program Termination ⋮ Inductive Completeness of Logics of Programs ⋮ European Summer Meeting of the Association for Symbolic Logic, Paris, 1985 ⋮ 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