Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article

Hoare Semigroups

  • GEORG STRUTH (a1)
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.

Copyright
COPYRIGHT: © Cambridge University Press 2017 
References
Hide All
Armstrong, A., Gomes, V.B.F. and Struth, G. (2014). Kleene algebra with tests and demonic refinement algebras. Archive of Formal Proofs. https://www.isa-afp.org/entries/KAT_and_DRA.shtml.
Armstrong, A., Gomes, V.B.F. and Struth, G. (2016). Building program construction and verification tools from algebraic principles. Formal Aspects of Computing 28 (2) 265–293.
Armstrong, A., Struth, G. and Weber, T. (2013a). Program analysis and verification based on Kleene algebra in Isabelle/HOL. In: Blazy, S., Paulin-Mohring, C. and Pichardie, D. (eds.) ITP 2013, Lecture Notes in Computer Science, vol. 7998, Springer, 197–212.
Armstrong, A., Struth, G. and Weber, T. (2013b). Kleene algebra. Archive of Formal Proofs. https://www.isa-afp.org/entries/Kleene_Algebra.shtml.
Chadha, R., Mateus, P., and Sernadas, A. (2006). Reasoning about imperative quantum programs. ENTCS 158 19–39.
den Hartog, J. and de Vink, E.P. (2002). Verifying probabilistic programs using a Hoare like logic. International Journal of Foundations of Computer Science 13 (3) 315–340.
Desharnais, J. and Struth, G. (2011). Internal axioms for domain semirings. Science of Computer Programming 76 (3) 181–203.
Furusawa, H. and Struth, G. (2015). Concurrent dynamic algebra. ACM TOCL 16 (4) 30:1–30:38.
Kozen, D. (1997). Kleene algebra with tests. ACM TOPLAS 19 (3) 427–443.
Kozen, D. (2000). On Hoare logic and Kleene algebra with tests. ACM TOCL 1 (1) 60–76.
Meijer, E., Fokkinga, M. and Paterson, R. (1991). Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, vol. 523, Springer, 124–144.
Morgan, C. (1994). Programming from Specifications, 2nd edition, Prentice Hall.
Nipkow, T., Paulson, L.C. and Wenzel, M. (2002). Isabelle/HOL - A Proof Assistant for Higher-Order Logic, Lecture Notes in Computer Science, vol. 2283, Springer.
Peleg, D. (1987). Concurrent dynamic logic. Journal of the ACM 34 (2) 450–479.
Pous, D. (2013). Kleene algebra with tests and Coq tools for while programs. In: Blazy, S., Paulin-Mohring, C. and Pichardie, D. (eds.) ITP 2013, Lecture Notes in Computer Science, vol. 7998, Springer, 180–196.
von Wright, J. (2004). Towards a refinement algebra. Science of Computer Programming 51 (1–2) 23–45.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 26 *
Loading metrics...

Abstract views

Total abstract views: 165 *
Loading metrics...

* Views captured on Cambridge Core between 4th April 2017 - 12th June 2018. This data will be updated every 24 hours.

Cancel
Confirm
×