Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.)
2 Pith papers cite this work, alongside 3 external citations. Polarity classification is still indexing.
2
Pith papers citing it
3
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Safety checking over tree topologies with fixed phases is EXPSPACE-complete and with variable phases is 2EXPSPACE-complete; depth bounds yield complexities in the fast growing hierarchy.
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.
-
On Parameterized Verification Over Tree Topologies
Safety checking over tree topologies with fixed phases is EXPSPACE-complete and with variable phases is 2EXPSPACE-complete; depth bounds yield complexities in the fast growing hierarchy.