Cited in
(44)- On equations and first-order theory of one-relator monoids
- Automata-based symbolic string analysis for vulnerability detection
- A decision procedure for string to code point conversion
- An Evaluation of Automata Algorithms for String Analysis
- Simple linear string constraints
- Context-oriented web application protection model
- String theories involving regular membership predicates: from practice to theory and back
- Relational string verification using multi-track automata
- StringFuzz
- An SMT solver for regular expressions and linear arithmetic over string length
- Static detection of DoS vulnerabilities in programs that use regular expressions
- Towards more efficient methods for solving regular-expression heavy string constraints
- The satisfiability of word equations: decidable and undecidable theories
- HAMPI
- Qex
- dk.brics.automaton
- Rex
- Kaluza
- Oscar.cbls
- Symbolic automata
- A decision procedure for regular membership and length constraints over unbounded strings
- PASS
- JST
- S3
- Z3-str
- iZplus
- Norn
- Picat-SAT
- StrSolve
- WAPTEC
- Merlin
- ExpoSE
- SymJS
- Z3str3
- Z3str2
- PQL
- TAJ
- MiniZinc with strings
- Dashed strings for string constraint solving
- Saner
- Chain-free string constraints
- An efficient SMT solver for string constraints
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- Symbolic automata: the toolkit
This page was built for software: Stranger
