Towards more efficient methods for solving regular-expression heavy string constraints
From MaRDI portal
Publication:2680985
DOI10.1016/J.TCS.2022.12.009OpenAlexW4311421541MaRDI QIDQ2680985FDOQ2680985
Authors: Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka 
Publication date: 5 January 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.009
Recommendations
- An SMT solver for regular expressions and linear arithmetic over string length
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- Solving String Theories Involving Regular Membership Predicates Using SAT
- Even Faster Conflicts and Lazier Reductions for String Solvers
- An efficient SMT solver for string constraints
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Finite automata and unary languages
- Chrobak normal form revisited, with applications
- Title not available (Why is that?)
- Path Feasibility Analysis for String-Manipulating Programs
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- Automata-based model counting for string constraints
- The satisfiability of word equations: decidable and undecidable theories
- String theories involving regular membership predicates: from practice to theory and back
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- An SMT solver for regular expressions and linear arithmetic over string length
- Title not available (Why is that?)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
Cited In (6)
- An SMT solver for regular expressions and linear arithmetic over string length
- Algorithms for checking intersection non-emptiness of regular expressions
- Unbounded model-checking with interpolation for regular language constraints
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Symbolic automata constraint solving
- Solving string constraints using SAT
Uses Software
This page was built for publication: Towards more efficient methods for solving regular-expression heavy string constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680985)
