Pith. sign in

REVIEW

Concurrent Kleene Algebra: Free Model and Completeness

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.02787 v3 pith:RI5LQP2C submitted 2017-10-08 cs.FL

Tobias Kappé , Paul Brunet , Alexandra Silva , Fabio Zanasi This is my paper · ORCID
classification cs.FL
keywords concurrentmodelalgebrafreehoarekleenesemanticsallow
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA with bounded parallelism are complete for the semantics proposed in the original paper; consequently, these semantics are the free model for this fragment. This result settles a conjecture of Hoare and collaborators. Moreover, the techniques developed along the way are reusable; in particular, they allow us to establish pomset automata as an operational model for CKA.

Discussion (0). Continue with ORCID to comment.

Pith tools