License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2019.2
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11309/
Go to the corresponding LIPIcs Volume Portal


Attiya, Hagit ; Enea, Constantin

Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects

pdf-format:
LIPIcs-DISC-2019-2.pdf (0.6 MB)


Abstract

It has been observed that linearizability, the prevalent consistency condition for implementing concurrent objects, does not preserve some probability distributions. A stronger condition, called strong linearizability has been proposed, but its study has been somewhat ad-hoc. This paper investigates strong linearizability by casting it in the context of observational refinement of objects. We present a strengthening of observational refinement, which generalizes strong linearizability, obtaining several important implications. When a concrete concurrent object refines another, more abstract object - often sequential - the correctness of a program employing the concrete object can be verified by considering its behaviors when using the more abstract object. This means that trace properties of a program using the concrete object can be proved by considering the program with the abstract object. This, however, does not hold for hyperproperties, including many security properties and probability distributions of events. We define strong observational refinement, a strengthening of refinement that preserves hyperproperties, and prove that it is equivalent to the existence of forward simulations. We show that strong observational refinement generalizes strong linearizability. This implies that strong linearizability is also equivalent to forward simulation, and shows that strongly linearizable implementations can be composed both horizontally (i.e., locality) and vertically (i.e., with instantiation). For situations where strongly linearizable implementations do not exist (or are less efficient), we argue that reasoning about hyperproperties of programs can be simplified by strong observational refinement of non-atomic abstract objects.

BibTeX - Entry

@InProceedings{attiya_et_al:LIPIcs:2019:11309,
  author =	{Hagit Attiya and Constantin Enea},
  title =	{{Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{2:1--2:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Jukka Suomela},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11309},
  doi =		{10.4230/LIPIcs.DISC.2019.2},
  annote =	{Keywords: Concurrent Objects, Linearizability, Hyperproperties, Forward Simulations}
}

Keywords: Concurrent Objects, Linearizability, Hyperproperties, Forward Simulations
Seminar: 33rd International Symposium on Distributed Computing (DISC 2019)
Issue Date: 2019
Date of publication: 08.10.2019


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