Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
citing papers explorer
-
On the Decidability of Verification under Release/Acquire
Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
-
An MSO Framework for Weak-Memory Verification and Robustness
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.