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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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 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.
-
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.