Symbolic automata constraint solving
From MaRDI portal
Publication:4933337
DOI10.1007/978-3-642-16242-8_45zbMATH Open1306.68097OpenAlexW2098697136MaRDI QIDQ4933337FDOQ4933337
Authors: Margus Veanes, Nikolaj Bjørner, Leonardo de Moura 
Publication date: 12 October 2010
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_45
Recommendations
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cited In (17)
- Succinct ordering and aggregation constraints in algebraic array theories
- Symbolic techniques in satisfiability solving
- Validity Checking for Finite Automata over Linear Arithmetic Constraints
- An Evaluation of Automata Algorithms for String Analysis
- A symbolic decision procedure for symbolic alternating finite automata
- Symbolic automatic relations and their applications to SMT and CHC solving
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- Simple linear string constraints
- Quantitative monitoring of STL with edit distance
- Symbolic tree automata
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Regular Expressions with Numerical Constraints and Automata with Counters
- Pumping, cleaning and symbolic constraints solving
- SMT-based generation of symbolic automata
- Constraint reasoning over strings
- Weighted Symbolic Automata with Data Storage
- An efficient SMT solver for string constraints
Uses Software
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)
