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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.