Automata-based model counting for string constraints
From MaRDI portal
Publication:1702923
DOI10.1007/978-3-319-21690-4_15zbMath1496.68254OpenAlexW1023119160MaRDI QIDQ1702923
Lucas Bang, Tevfik Bultan, Abdulbaki Aydin
Publication date: 1 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-21690-4_15
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Algorithms on strings (68W32) Computational aspects of satisfiability (68R07)
Related Items (7)
A Study of Symmetry Breaking Predicates and Model Counting ⋮ Improving Symbolic Automata Learning with Concolic Execution ⋮ An SMT solver for regular expressions and linear arithmetic over string length ⋮ Towards more efficient methods for solving regular-expression heavy string constraints ⋮ Word equations in synergy with regular constraints ⋮ Unnamed Item ⋮ On equations and first-order theory of one-relator monoids
This page was built for publication: Automata-based model counting for string constraints
