Towards reasoning about Hoare relations

DOI10.1007/BF01530788zbMath0858.68057OpenAlexW2073120895MaRDI QIDQ1924753

Ingrid Rewitzky, Stéphane P. Demri, Ewa S. Orłowska

Publication date: 25 March 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

Hoare postulatesHoare-style programming languages

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items

Equational Reasoning in Non-Classical Logics

Cites Work

• Modal definability in enriched languages
• PDL with data constants
• The weakest prespecification
• First-order dynamic logic
• Modal logic with names
• General correctness: A unification of partial and total correctness
• Laws of programming
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• The modal logic of inequality
• A Powerdomain Construction
• Dynamic logic with program specifications and its relational proof system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item