Partially Observable Concurrent Kleene Algebra

07/15/2020
by   Jana Wagemaker, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2018

Kleene Algebra with Observations

Kleene algebra with tests (KAT) is an algebraic framework for reasoning ...
research
01/25/2022

Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

We introduce Concurrent NetKAT (CNetKAT), an extension of NetKAT with op...
research
10/31/2019

Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra

Concurrent Kleene Algebra is an elegant tool for equational reasoning ab...
research
03/03/2021

An Axiomatic Approach to Detect Information Leaks in Concurrent Programs

Realizing flow security in a concurrent environment is extremely challen...
research
10/07/2008

The meaning of concurrent programs

The semantics of assignment and mutual exclusion in concurrent and multi...
research
02/22/2020

Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a para...
research
06/12/2017

Serialisable Multi-Level Transaction Control: A Specification and Verification

We define a programming language independent controller TaCtl for multi-...

Please sign up or login with your details

Forgot password? Click here to reset