Concurrent Library Correctness on the TSO Memory Model

DOI10.1007/978-3-642-28869-2_5zbMath1352.68049OpenAlexW136533073MaRDI QIDQ2892722

Hongseok Yang, Alexey Gotsman, Madanlal Musuvathi, Sebastian Burckhardt

Publication date: 22 June 2012

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28869-2_5

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (8)

TSO-to-TSO linearizability is undecidable ⋮ Unifying Operational Weak Memory Verification: An Axiomatic Approach ⋮ Model Checking Simulation Rules for Linearizability ⋮ Balancing expressiveness in formal approaches to concurrency ⋮ 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

Uses Software

• Line-up

This page was built for publication: Concurrent Library Correctness on the TSO Memory Model