LIPIcs.CONCUR.2017.34.pdf
- Filesize: 0.8 MB
- 18 pages
Document
Higher-Order Linearisability
Authors
-
Part of:
Volume:
28th International Conference on Concurrency Theory (CONCUR 2017)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Concurrency Theory (CONCUR) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-09-01
Cite As Get BibTex
Andrzej S. Murawski and Nikos Tzevelekos. Higher-Order Linearisability. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.CONCUR.2017.34
Abstract
Linearisability is a central notion for verifying concurrent libraries: a library is proven correct if its operational history can be rearranged into a sequential one that satisfies a given specification. Until now, linearisability has been examined for libraries in which method arguments and method results were of ground type. In this paper we extend linearisability to the general higher-order setting, where methods of arbitrary type can be passed as arguments and returned as values, and establish its soundness.
Subject Classification
Keywords
- Linearisability
- Concurrency
- Higher-Order Computation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads