What’s Decidable about Weak Memory Models?
From MaRDI portal
Publication:2892719
DOI10.1007/978-3-642-28869-2_2zbMath1352.68056OpenAlexW123460966MaRDI QIDQ2892719
Ahmed Bouajjani, Madanlal Musuvathi, Sebastian Burckhardt, Mohamed Faouzi Atig
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_2
Related Items (9)
Unnamed Item ⋮ Parallelized sequential composition and hardware weak memory models ⋮ Probabilistic total store ordering ⋮ Unnamed Item ⋮ Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models ⋮ Context-Bounded Analysis of TSO Systems ⋮ Unnamed Item ⋮ Studying Operational Models of Relaxed Concurrency
Uses Software
This page was built for publication: What’s Decidable about Weak Memory Models?
