TY  - JOUR
A1  - Hoare, C. A. R.
A1  - Möller, Bernhard
A1  - Struth, Georg
A1  - Wehrman, Ian
T1  - Foundations of concurrent Kleene Algebra
T2  - Lecture Notes in Computer Science
N2  - 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.
Y1  - 2009
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/68905
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-689059
SN  - 9783642046384
SN  - 9783642046391
SN  - 0302-9743
SN  - 1611-3349
VL  - 5827
SP  - 166
EP  - 186
PB  - Springer
CY  - Berlin
ER  -