Concurrent Kleene algebra

  • A concurrent Kleene algebra offers, next to choice and iteration, two composition operators, one that stands for sequential execution and the other for concurrent execution. They are related by an inequational form of the exchange law. We show the applicability of the algebra to a partially-ordered trace model of program execution semantics and demonstrate its usefulness by validating familiar proof rules for sequential programs (Hoare triples) and for concurrent programming (Jones's rely/guarantee calculus). The latter involves an algebraic notion of invariants; for these the exchange inequation strengthens to an equational distributivity law. Most of our reasoning has been checked by computer.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Charles Antony Richard Hoare, Bernhard MöllerGND, Georg StruthGND, Ian Wehrman
URN:urn:nbn:de:bvb:384-opus4-10944
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/1301
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2009-04)
Publisher:Institut für Informatik, Universität Augsburg
Place of publication:Augsburg
Type:Report
Language:English
Year of first Publication:2009
Publishing Institution:Universität Augsburg
Contributing Corporation:Microsoft Research Cambridge, University of Sheffield, University of Texas at Austin
Release Date:2009/09/01
Tag:Kleene Algebra
GND-Keyword:Kleene-Algebra
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht

OPUS4 Logo