What's decidable about weak memory models?

DOI10.1007/978-3-642-28869-2_2MaRDI QIDQ2892719zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On the verification problem for weak memory models
• Context-bounded analysis of TSO systems
• The decidability of verification under PS 2.0
• Deciding Robustness against Total Store Ordering
• Stateless model checking for TSO and PSO

Cited in

(11)

• The decidability of verification under PS 2.0
• Checking robustness between weak transactional consistency models
• Studying Operational Models of Relaxed Concurrency
• A load-buffer semantics for total store ordering
• Regular separability of well-structured transition systems
• Context-bounded analysis of TSO systems
• On the verification problem for weak memory models
• scientific article; zbMATH DE number 7327945 (Why is no real title available?)
• Robustness Against Transactional Causal Consistency.
• Parallelized sequential composition and hardware weak memory models
• Probabilistic total store ordering

Describes a project that uses

Uses Software

• UMM

This page was built for publication: What's decidable about weak memory models?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892719)