We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access variables and values, which we illustrate through concrete examples. We prove that POCKA is a sound and complete axiomatisation of a model of partial observations, and show the semantics passes an important check for sequential consistency.
- Pub Date:
- July 2020
- Computer Science - Logic in Computer Science;
- Computer Science - Formal Languages and Automata Theory;
- Computer Science - Programming Languages
- Accepted for publication at CONCUR 2020