Towards reasoning about Hoare relations

DOI10.1007/BF01530788zbMATH Open0858.68057OpenAlexW2073120895MaRDI QIDQ1924753FDOQ1924753

Stéphane Demri, Ewa Orłowska, Ingrid Rewitzky

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)

Cites Work

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

Cited In (5)

• On the two definitions of Ho(pro C)
• Title not available (Why is that?)
• How helpers hasten \(h\)-relations
• Bibliography of Ewa Orłowska
• Equational Reasoning in Non-Classical Logics

This page was built for publication: Towards reasoning about Hoare relations

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