Show No Weakness: Sequentially Consistent Specifications of TSO Libraries

DOI10.1007/978-3-642-33651-5_3zbMath1377.68038OpenAlexW146875869MaRDI QIDQ4909400

Hongseok Yang, Madanlal Musuvathi, Alexey Gotsman

Publication date: 13 March 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_3

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (6)

TSO-to-TSO linearizability is undecidable ⋮ Model Checking Simulation Rules for Linearizability ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Decidability of liveness for concurrent objects on the TSO memory model ⋮ A Framework for Correctness Criteria on Weak Memory Models ⋮ Linearizability on hardware weak memory models

This page was built for publication: Show No Weakness: Sequentially Consistent Specifications of TSO Libraries