Cited in
(39)- On equations and first-order theory of one-relator monoids
- A decision procedure for string to code point conversion
- String theories involving regular membership predicates: from practice to theory and back
- Word equations in the context of string solving
- Constraint programming for dynamic symbolic execution of JavaScript
- StringFuzz
- Completeness of abstract domains for string analysis of JavaScript programs
- Towards more efficient methods for solving regular-expression heavy string constraints
- The satisfiability of word equations: decidable and undecidable theories
- JavaScript
- Stranger
- HAMPI
- Qex
- Rex
- Oscar.cbls
- PASS
- S3
- Z3-str
- iZplus
- StrSolve
- WAPTEC
- ModelPlex
- Jalangi
- JBMC
- ExpoSE
- JSAI
- Phantm
- SymJS
- Z3str3
- Z3str2
- MiniZinc with strings
- Dashed strings for string constraint solving
- Bex
- Saner
- Chain-free string constraints
- ZaligVinder
- Completeness of string analysis for dynamic languages
- CertiStr
- Design and implementation of bounded-length sequence variables
This page was built for software: Norn
