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.
A variant of a recursively unsolvable problem
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
Investigates decidability of existence of words with copy-, marked-copy-, and shuffle-based forms inside regular and linear context-free languages.
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.
-
Decision Problems on Copying and Shuffling
Investigates decidability of existence of words with copy-, marked-copy-, and shuffle-based forms inside regular and linear context-free languages.