Brief Announcement: Linearizability: A Typo
From MaRDI portal
Publication:6201985
DOI10.1145/3465084.3467944arXiv2105.06737MaRDI QIDQ6201985FDOQ6201985
Authors: Gal Sela, Maurice Herlihy, Erez Petrank 
Publication date: 26 March 2024
Published in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Abstract: Linearizability is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions as correct if operations on shared objects appear to take effect instantaneously during the operation execution time. This paper calls attention to a somewhat-neglected aspect of linearizability: restrictions on how pending invocations are handled, an issue that has become increasingly important for software running on systems with non-volatile main memory. Interestingly, the original published definition of linearizability includes a typo (a symbol is missing a prime) that concerns exactly this issue. In this paper we point out the typo and provide an amendment to make the definition complete. We believe that pointing this typo out rigorously and proposing a fix is important and timely.
Full work available at URL: https://arxiv.org/abs/2105.06737
This page was built for publication: Brief Announcement: Linearizability: A Typo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201985)
