Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
Reachability for RDMA programs is undecidable, but robustness under RDMA versus sequential consistency is decidable with EXPSPACE (or PSPACE without polls) complexity, and these bounds are tight.
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.
Consistency testing for release-acquire C11 is in P with one writer per location but NP-hard with two writers and ETH-hard for subexponential time with three writers.
Generalizes rely-guarantee to parametric memory models and presents Piccolo, the first such logic for causally consistent shared memory using potential-based operational semantics.
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 the Verification Problem of Remote Direct Memory Access programs (Extended Version with Appendix)
Reachability for RDMA programs is undecidable, but robustness under RDMA versus sequential consistency is decidable with EXPSPACE (or PSPACE without polls) complexity, and these bounds are tight.
-
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.
-
Complexity of Consistency Testing for the Release-Acquire Semantics
Consistency testing for release-acquire C11 is in P with one writer per location but NP-hard with two writers and ETH-hard for subexponential time with three writers.
-
Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
Generalizes rely-guarantee to parametric memory models and presents Piccolo, the first such logic for causally consistent shared memory using potential-based operational semantics.