Foundations of concurrent Kleene Algebra

  • A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands for sequential execution and the other for concurrent execution of program components. After introducing this motivating concrete application, we investigate its abstract background in terms of a primitive independence relation between the traces. On this basis, we develop a series of richer algebras; the richest validates a proof calculus for programs similar to that of a Jones style rely/guarantee calculus. On the basis of this abstract algebra, we finally reconstruct the original trace model, using the notion of atoms from lattice theory.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:C. A. R. Hoare, Bernhard MöllerGND, Georg StruthGND, Ian Wehrman
URN:urn:nbn:de:bvb:384-opus4-689059
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/68905
ISBN:9783642046384OPAC
ISBN:9783642046391OPAC
ISSN:0302-9743OPAC
ISSN:1611-3349OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Place of publication:Berlin
Type:Article
Language:English
Year of first Publication:2009
Publishing Institution:Universität Augsburg
Release Date:2020/01/20
Volume:5827
First Page:166
Last Page:186
DOI:https://doi.org/10.1007/978-3-642-04639-1_12
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