Solving Not-Substring Constraint withFlat Abstraction
Abstract elided by the publisher.
Related papers
- Solving String Constraints Using SAT CAV 2023
- Synthesis of first-order dynamic programming algorithms OOPSLA 2011
- An LR Substring Parser for Noncorrecting Syntax Error Recovery PLDI 1989
- Recognizing Substrings of LR(k) Languages in Linear Time POPL 1992
- Recognizing Substrings of LR(k) Languages in Linear Time TOPLAS 1994
- Subsequence References: First-Class Values for Substrings TOPLAS 1992
- Repairing Regular Expressions for Extraction PLDI 2023
- JDart: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution) TACAS 2021