Solving String Theories Involving Regular Membership Predicates Using SAT
From MaRDI portal
Publication:6487302
Recommendations
- String theories involving regular membership predicates: from practice to theory and back
- Solving constraint satisfaction problems with SAT modulo theories
- An efficient SMT solver for string constraints
- A theory of satisfiability-preserving proofs in SAT solving
- Constraint reasoning over strings
- scientific article; zbMATH DE number 554989
- Propositional SAT solving
- Variant Satisfiability of Parameterized Strings
Cites work
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- scientific article; zbMATH DE number 1798184 (Why is no real title available?)
- scientific article; zbMATH DE number 3062907 (Why is no real title available?)
- An SMT solver for regular expressions and linear arithmetic over string length
- An efficient algorithm for solving word equations
- Derivatives of Regular Expressions
- Finite automata and unary languages
- On solving word equations using SAT
- Periodic sets of integers
- String theories involving regular membership predicates: from practice to theory and back
- The expressibility of languages and relations by word equations
Cited in
(8)- A decision procedure for regular membership and length constraints over unbounded strings
- String theories involving regular membership predicates: from practice to theory and back
- Unbounded model-checking with interpolation for regular language constraints
- Towards more efficient methods for solving regular-expression heavy string constraints
- Verified verifying: SMT-LIB for strings in Isabelle
- Symbolic automata constraint solving
- Solving string constraints using SAT
- An efficient SMT solver for string constraints
This page was built for publication: Solving String Theories Involving Regular Membership Predicates Using SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487302)
