Struth, G. (2018) Hoare semigroups. Mathematical Structures in Computer Science, 28 (6). ISSN 0960-1295
Abstract
A semigroup-based setting for developing Hoare logics and refinement calculi is introduced together with procedures for translating between verification and refinement proofs. A new Hoare logic for multirelations and two minimalist generic verification and refinement components, implemented in an interactive theorem prover, are presented as applications that benefit from this generalisation.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 Cambridge University Press. This is an author produced version of a paper subsequently published in Mathematical Structures in Computer Science. Article available under the terms of the CC-BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/). |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 18 May 2017 11:11 |
Last Modified: | 20 Jul 2023 11:36 |
Status: | Published |
Publisher: | Cambridge University Press |
Refereed: | Yes |
Identification Number: | 10.1017/S096012951700007X |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:116277 |