TY  - RPRT
A1  - Hoare, Charles Antony Richard
A1  - Möller, Bernhard
A1  - Struth, Georg
A1  - Wehrman, Ian
T1  - Concurrent Kleene algebra
N2  - 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.
T3  - Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg - 2009-04 
KW  - Kleene-Algebra
KW  - Kleene Algebra
Y1  - 2009
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1301
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-10944
PB  - Institut für Informatik, Universität Augsburg
CY  - Augsburg
ER  -