Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects

DOI10.4230/LIPICS.DISC.2019.2MaRDI QIDQ6487519zbMATH OpenFDO

Authors Hagit Attiya, Constantin Enea

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2019.2

zbMATH Keywords

concurrent objectsforward simulationshyperpropertieslinearizability

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Strict linearizability and abstract atomicity
• Strongly linearizable implementations, possibilities and impossibilities
• Relating trace refinement and linearizability
• Linearizability on hardware weak memory models
• On abstraction and compositionality for weak-memory linearisability

Cited in

(8)

• Randomized consensus with regular registers
• On atomic registers and randomized consensus in m\&m systems
• Local linearizability for concurrent container-type data structures
• scientific article; zbMATH DE number 7774258 (Why is no real title available?)
• Optimal resilience in systems that mix shared memory and message passing
• Preserving hyperproperties of programs using primitives with consensus number 2
• Faithful simulation of randomized BFT protocols on block DAGs
• Strong linearizability using primitives with consensus number 2

This page was built for publication: Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487519)