In praise of algebra
Formal Aspects of Computing · 2012-07 · 24 (4-6) · 423-431
DOI: 10.1007/s00165-012-0249-0 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Aspects of Computing, 2012-07. Verfasst von Tony Hoare und 1 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
We survey the well-known algebraic laws of sequential programming, and extend them with some less familiar laws for concurrent programming. We give an algebraic definition of the Hoare triple, and algebraic proofs of all the relevant laws for concurrent separation logic. We give the provable concurrency laws for Milner transitions, for the Back/Morgan refinement calculus, and for Dijkstra’s weakest preconditions. We end with a section in praise of algebra, of which Carroll Morgan is such a master.
Zitieren
APA
Hoare, T., & Staden, S. V. (2012). In praise of algebra. Formal Aspects of Computing, 24(4-6), 423-431. https://doi.org/10.1007/s00165-012-0249-0
Vancouver
Hoare T, Staden SV. In praise of algebra. Formal Aspects of Computing. 2012;24(4-6):423-431. doi:10.1007/s00165-012-0249-0
BibTeX
@article{Hoare2012,
author = {Hoare, Tony and Staden, Stephan van},
title = {In praise of algebra},
journal = {Formal Aspects of Computing},
year = {2012},
volume = {24},
number = {4-6},
pages = {423--431},
doi = {10.1007/s00165-012-0249-0}
}
EUVIMED