Symbolic automata constraint solving
From MaRDI portal
Recommendations
Cited in
(19)- Quantitative monitoring of STL with edit distance
- A symbolic algorithm for the case-split rule in string constraint solving
- A symbolic decision procedure for symbolic alternating finite automata
- Symbolic automatic relations and their applications to SMT and CHC solving
- SMT-based generation of symbolic automata
- Weighted symbolic automata with data storage
- A decision procedure for regular membership and length constraints over unbounded strings
- An Evaluation of Automata Algorithms for String Analysis
- Regular Expressions with Numerical Constraints and Automata with Counters
- Pumping, cleaning and symbolic constraints solving
- Simple linear string constraints
- Symbolic tree automata
- An efficient SMT solver for string constraints
- Unbounded model-checking with interpolation for regular language constraints
- Validity Checking for Finite Automata over Linear Arithmetic Constraints
- Constraint reasoning over strings
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Succinct ordering and aggregation constraints in algebraic array theories
- Symbolic techniques in satisfiability solving
This page was built for publication: Symbolic automata constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933337)