scientific article; zbMATH DE number 7774258

DOI10.4230/LIPICS.DISC.2021.7MaRDI QIDQ6083367zbMATH OpenFDO

Authors Hagit Attiya, Constantin Enea, Jennifer L. Welch

Publication date 8 December 2023

Full work available at URL https://arxiv.org/abs/2105.06614

zbMATH Keywords

BG simulationconcurrent objectsimpossibility proofsmessage-passing systemsshared registersstrong linearizability

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Strongly linearizable implementations, possibilities and impossibilities
• On the completeness of verifying message passing programs under bounded asynchrony
• Synchronous message passing: on the relation between bisimulation and refusal equivalence
• Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
• Beyond atomic registers: Bounded wait-free implementations of nontrivial objects
• Deadlock-free incremental replay of message-passing programs
• A sound and complete proof technique for linearizability of concurrent data structures
• scientific article; zbMATH DE number 7774287

Cited in

(2)

• Preserving hyperproperties of programs using primitives with consensus number 2
• Strong linearizability using primitives with consensus number 2

This page was built for publication:

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