The following pages link to HAMPI (Q21843):
Displaying 18 items.
- Simple linear string constraints (Q469349) (← links)
- An efficient SMT solver for string constraints (Q518402) (← links)
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Harnessing static analysis to help learn pseudo-inverses of string manipulating procedures for automatic test generation (Q784127) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings (Q1626699) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Automata-based symbolic string analysis for vulnerability detection (Q2248096) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- MiniZinc with strings (Q2409726) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Data-Parallel String-Manipulating Programs (Q2819798) (← links)
- Symbolic Automata: The Toolkit (Q2894292) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
