Proving Linearizability Via Non-atomic Refinement

DOI10.1007/978-3-540-73210-5_11zbMath1213.68370OpenAlexW2104046157MaRDI QIDQ3608884

John Derrick, Gerhard Schellhorn, Heike Wehrheim

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73210-5_11

zbMATH Keywords

CSPrefinementlinearizabilityObject-Zconcurrent access

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Proving linearizability with temporal logic ⋮ A general technique for proving lock-freedom ⋮ Relational concurrent refinement. III: Traces, partial relations and automata

This page was built for publication: Proving Linearizability Via Non-atomic Refinement