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.
On the reachability problem for 5-dimensional vector addition systems
2 Pith papers cite this work, alongside 286 external citations. Polarity classification is still indexing.
2
Pith papers citing it
286
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Reachability in priority-inhibitory CRNs is mostly in P for deletion-only systems but NP-complete in one case; in inhibitory CRNs it is mostly NP-complete for deletion-only and PSPACE-complete even for (1,1)-size reactions.
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.
-
Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
Reachability in priority-inhibitory CRNs is mostly in P for deletion-only systems but NP-complete in one case; in inhibitory CRNs it is mostly NP-complete for deletion-only and PSPACE-complete even for (1,1)-size reactions.