The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
Chen, Jason Flinn, and Satish Narayanasamy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents sound abstract interpretation plus controlled unsoundness techniques to produce tighter, efficient, terminating approximations of fixed points for non-monotone processes.
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.
-
Bounding Fixed Points of Non-Monotone Processes: Theory to Practice
Presents sound abstract interpretation plus controlled unsoundness techniques to produce tighter, efficient, terminating approximations of fixed points for non-monotone processes.