Reproduce “Decision Procedure for A Theory of String Sequences” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Denghang Hu, Taolue Chen, Philipp Rümmer, Fu Song, Zhilin Wu
Researchers developed a decision procedure for `SeqStr_SL`, a decidable fragment of a theory integrating integers, strings, and string sequences, addressing complex string-sequence operations. The resulting `OSTRICH_SEQ` solver demonstrated superior performance, solving all benchmarks involving operations like `split`, `join`, `filter`, and `matchAll`, including instances that other state-of-the-art SMT solvers could not process.
Key insights
- While the full `SeqStr` logic is undecidable, its straight-line fragment (`SeqStr_SL`) is decidable and highly relevant for practical program verification tasks derived from symbolic execution or bounded model checking.
- String sequences can be effectively reduced to string problems by encoding them as single strings with a fresh separator, enabling the application of existing powerful string constraint solving techniques.
- Pre-image computation for complex, non-standard string operations (e.g., `write`, `subseq`, `elem`) using Cost-Enriched Finite Automata is feasible, allowing their integration into existing string solver frameworks like OSTRICH.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.