Kappé, T;
Brunet, P;
Silva, A;
Zanasi, F;
(2018)
Concurrent Kleene Algebra: Free Model and Completeness.
In: Ahmed, A, (ed.)
Programming Languages and Systems.
(pp. pp. 856-882).
Springer: Thessaloniki, Greece.
Preview |
Text
10.1007%2F978-3-319-89884-1.pdf - Published Version Available under License : See the attached licence file. Download (29MB) | Preview |
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 technique developed to this end allows us to establish a Kleene Theorem for CKA, extending an earlier Kleene Theorem for a fragment of CKA.
Type: | Proceedings paper |
---|---|
Title: | Concurrent Kleene Algebra: Free Model and Completeness. |
Event: | ESOP 2018 - 27th European Symposium on Programming |
ISBN-13: | 978-3-319-89883-4 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/978-3-319-89884-1 |
Publisher version: | https://doi.org/10.1007/978-3-319-89884-1 |
Language: | English |
Additional information: | © The Author(s) 2018 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10047906 |
Archive Staff Only
View Item |