Progressive reasoning over recursively-defined strings
From MaRDI portal
Recommendations
- Model counting for recursively-defined strings
- An efficient SMT solver for string constraints
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- Scaling up DPLL(T) string solvers using context-dependent simplification
- A symbolic algorithm for the case-split rule in string constraint solving
Cited in
(14)- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- Dashed strings for string constraint solving
- On equations and first-order theory of one-relator monoids
- Model counting for recursively-defined strings
- Chain-free string constraints
- Intelligent Processing of an Unrestricted Text in First Order String Calculus
- scientific article; zbMATH DE number 7559472 (Why is no real title available?)
- scientific article; zbMATH DE number 7561688 (Why is no real title available?)
- Word equations in synergy with regular constraints
- A closer look at the expressive power of logics based on word equations
- Program specialization as a tool for solving word equations
- On the satisfiability of context-free string constraints with subword-ordering
- Word equations in synergy with regular constraints (extended version)
- An SMT solver for regular expressions and linear arithmetic over string length
This page was built for publication: Progressive reasoning over recursively-defined strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633536)
