Wait-free linearization with an assertional proof

DOI10.1007/BF02280829zbMath1448.68109OpenAlexW2028410161MaRDI QIDQ5136979

Wim H. Hesselink

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02280829

zbMATH Keywords

stabilitycorrectnessinvariantmemory managementtime complexityconsensusspace complexitywait-freelinearizableconcurrent data object

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

Bounded delay for a free address ⋮ Wait-free linearization with a mechanical proof

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• The Hoare logic of concurrent programs
• On-the-fly garbage collection for several mutators
• An axiomatic proof technique for parallel programs
• The ``Hoare Logic of CSP, and All That
• Impossibility of distributed consensus with one faulty process

This page was built for publication: Wait-free linearization with an assertional proof