Towards reasoning about Hoare relations
type: Item
instance of: scholarly article
title: Towards reasoning about Hoare relations
zbMATH Open document ID: 0858.68057
DOI: 10.1007/BF01530788
author: Ingrid Rewitzky
author: Stéphane Demri
author: Ewa Orłowska
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 937255
zbMATH Keywords: Hoare postulates
zbMATH Keywords: Hoare-style programming languages
MaRDI profile type: Publication
cites work: Q4342093
cites work: Q3867808
cites work: Q5678412
cites work: The modal logic of inequality
cites work: Q4692630
cites work: Modal logic with names
cites work: Modal definability in enriched languages
cites work: Q3478385
cites work: Q3877020
cites work: First-order dynamic logic
cites work: Laws of programming
cites work: Q3740201
cites work: The weakest prespecification
cites work: General correctness: A unification of partial and total correctness
cites work: Q3792662
cites work: A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
cites work: Dynamic logic with program specifications and its relational proof system
cites work: A Powerdomain Construction
cites work: PDL with data constants
cites work: Q5734410
cites work: Q3337453
cites work: Q4342096
full work available at URL: https://doi.org/10.1007/bf01530788
OpenAlex ID: W2073120895
description: scientific article; zbMATH DE number 937255