Concurrent Kleene Algebra

Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show 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 ones (Jones’s rely/guarantee calculus). This 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.

• Type: Conference
• Year: 2009
• Where: CONCUR
• Authors: C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman
• Keywords: CONCUR 2009, Concurrent Composition, Concurrent Kleene Algebra, Familiar Proof Rules