Local linearizability for concurrent container-type data structures

DOI10.4230/LIPIcs.CONCUR.2016.6zbMath1392.68152OpenAlexW2547570521MaRDI QIDQ4608657

Helmut Veith, Ali Sezgin, Ana Sokolova, Christoph Kirsch, Andreas Holzer, Hannes Payer, Michael Lippautz, Andreas Haas, Thomas A. Henzinger

Publication date: 21 March 2018

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.6

zbMATH Keywords

linearizabilityconcurrent data structuresrelaxed semantics

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items (3)

Verifying Visibility-Based Weak Consistency ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Unnamed Item

This page was built for publication: Local linearizability for concurrent container-type data structures