Verifying Weak Release-Acquire consistency for register machines is in O(n^5), while verifying Release-Acquire and Strong Release-Acquire is in PSPACE and both NP- and coNP-hard as claimed.
Clarifying and compiling C/C++ concurrency: from C++11 to POWER
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The complexity of verifying the release-acquire semantics over register machines
Verifying Weak Release-Acquire consistency for register machines is in O(n^5), while verifying Release-Acquire and Strong Release-Acquire is in PSPACE and both NP- and coNP-hard as claimed.