Even Faster Conflicts and Lazier Reductions for String Solvers
From MaRDI portal
Publication:6487337
DOI10.1007/978-3-031-13188-2_11zbMATH Open1514.68274MaRDI QIDQ6487337FDOQ6487337
Authors: Andres Nötzli, Andrew Reynolds, Haniel Barbosa, Clark Barrett, Cesare Tinelli 
Publication date: 7 December 2022
Recommendations
- 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
- Towards more efficient methods for solving regular-expression heavy string constraints
- Designing theory solvers with extensions
Cites Work
- A mathematical introduction to logic.
- Solving SAT and SAT Modulo Theories
- Satisfiability Modulo Theories
- Computer Aided Verification
- Fast Decision Procedures Based on Congruence Closure
- An Evaluation of Automata Algorithms for String Analysis
- Path Feasibility Analysis for String-Manipulating Programs
- Symbolic automata constraint solving
- Tools and algorithms for the construction and analysis of systems. 28th international conference, TACAS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings. Part I
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Qex: symbolic SQL query explorer
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Stratified abstraction of access control policies
- High-level abstractions for simplifying extended string constraints in SMT
Cited In (7)
- Title not available (Why is that?)
- Word equations in synergy with regular constraints
- Towards more efficient methods for solving regular-expression heavy string constraints
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Reasoning About Regular Properties: A Comparative Study
- Solving string constraints using SAT
- Scaling up DPLL(T) string solvers using context-dependent simplification
This page was built for publication: Even Faster Conflicts and Lazier Reductions for String Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487337)
