The following pages link to Z3str2 (Q42234):
Displaying 5 items.
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
