Results 21 to 30 of about 1,172 (171)
On Register Linearizability and Termination [PDF]
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021 In a seminal work, Golab et al. showed that a randomized algorithm that works with atomic objects may lose some of its properties if we replace the atomic objects that it uses with linearizable objects. It was not known whether the properties that can be lost include the important property of termination (with probability 1).
Vassos Hadzilacos +2 more
openaire +4 more sources
CoRR, 2021 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.
Gal Sela 0001 +2 more
openaire +2 more sources
Linearizable Eigenvector Nonlinearities
SIAM Journal on Matrix Analysis and Applications, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rob Claes +3 more
openaire +4 more sources
A Compositional Theory of Linearizability
Proceedings of the ACM on Programming Languages, 2023 Compositionality is at the core of programming languages research and has become an important goal toward scalable verification of large systems. Despite that, there is no compositional account of linearizability, the gold standard of correctness for concurrent objects.In this paper, we develop a compositional semantics for linearizable concurrent ...
Arthur Oliveira Vale +2 more
openaire +1 more source
Faster linearizability checking via P-compositionality [PDF]
, 2015 Linearizability is a well-established consistency and correctness criterion for concurrent data types. An important feature of linearizability is Herlihy and Wing’s locality principle, which says that a concurrent system is linearizable if and only if ...
Kroening, Daniel +3 more
core +2 more sources
Library abstraction for C/C++ concurrency [PDF]
, 2013 When constructing complex concurrent systems, abstraction is vi-tal: programmers should be able to reason about concurrent li-braries in terms of abstract specifications that hide the implementa-tion details.
Alexey Gotsman +5 more
core +1 more source
Testing for linearizability [PDF]
Concurrency and Computation: Practice and Experience, 2016 SummaryLinearizability is a well established correctness condition for concurrent datatypes. Informally, a concurrent datatype is linearizable if operation calls appear to have an effect, one at a time, in an order that is consistent with a sequential (specification) datatype, with each operation taking effect between the point at which it is called ...
openaire +1 more source
CoRR, 2016 Full version of submission to SEFM ...
Simon Doherty, John Derrick
openaire +2 more sources
Linearizable counting networks [PDF]
Distributed Computing, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maurice Herlihy, Nir Shavit, Orli Waarts
openaire +2 more sources
The Path to Durable Linearizability
Proceedings of the ACM on Programming Languages, 2023 There is an increasing body of literature proposing new and efficient persistent versions of concurrent data structures ensuring that a consistent state can be recovered after a power failure or a crash. Their correctness is typically stated in terms of durable linearizability (DL), which requires that ...
Emanuele D'Osualdo +2 more
openaire +4 more sources