Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
25th Annual European Symposium on Algorithms (ESA 2017) , pages =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.
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.
-
Verifying Sequential Consistency under Bounded Preemptions
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.