Symbolic Automata Constraint Solving

DOI10.1007/978-3-642-16242-8_45zbMath1306.68097OpenAlexW2098697136MaRDI QIDQ4933337

Leonardo de Moura, Nikolaj Bjørner, Margus Veanes

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

A symbolic decision procedure for symbolic alternating finite automata ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ Quantitative monitoring of STL with edit distance ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Simple linear string constraints ⋮ Symbolic tree automata ⋮ An efficient SMT solver for string constraints ⋮ An Evaluation of Automata Algorithms for String Analysis ⋮ Weighted Symbolic Automata with Data Storage

Uses Software

• z3

This page was built for publication: Symbolic Automata Constraint Solving