The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
Non-Sequential Theory of Distributed Systems , publisher =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.