Brief announcement: Concurrency-aware Linearizability

Nir Hemed, Noam Rinetzky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations


Linearizabilty allows to describe the behaviour of concurrent objects using sequential specifications. Unfortunately, as we show in this paper, sequential specifications cannot be used for concurrent objects whose observable behaviour in the presence of concurrent operations should be different than their behaviour in the sequential setting. As a result, such concurrency-aware objects do not have formal specifications, which, in turn, precludes formal verification. In this paper we present Concurrency Aware Linearizability (CAL), a new correctness condition which allows to formally specify the behaviour of a certain class of concurrency-aware objects. Technically, CAL is formalized as a strict extension of linearizability, where concurrency-aware specifications are used instead of sequential ones. We believe that CAL can be used as a basis for modular formal verification techniques for concurrency-aware objects.

Original languageEnglish
Title of host publicationPODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Number of pages3
ISBN (Print)9781450329446
StatePublished - 2014
Event2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 - Paris, France
Duration: 15 Jul 201418 Jul 2014

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


Conference2014 ACM Symposium on Principles of Distributed Computing, PODC 2014


  • Concurrent specification
  • Linearizability
  • Sequential specification


Dive into the research topics of 'Brief announcement: Concurrency-aware Linearizability'. Together they form a unique fingerprint.

Cite this