License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.34
URN: urn:nbn:de:0030-drops-78035
Go to the corresponding LIPIcs Volume Portal

Murawski, Andrzej S. ; Tzevelekos, Nikos

Higher-Order Linearisability

LIPIcs-CONCUR-2017-34.pdf (0.8 MB)


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.

BibTeX - Entry

  author =	{Andrzej S. Murawski and Nikos Tzevelekos},
  title =	{{Higher-Order Linearisability}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{34:1--34:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-78035},
  doi =		{10.4230/LIPIcs.CONCUR.2017.34},
  annote =	{Keywords: Linearisability, Concurrency, Higher-Order Computation}

Keywords: Linearisability, Concurrency, Higher-Order Computation
Collection: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 01.09.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI