Automata-Based Model Counting for String Constraints
No abstract available.
Related papers
- A Constraint Solving Approach to Parikh Images of Regular Languages OOPSLA 2024
- A model counter for constraints over unbounded strings PLDI 2014
- Parikh's Theorem Made Symbolic POPL 2024
- A Uniform Framework for Handling Position Constraints in String Solving PLDI 2025
- String Solving with Stabilization and Transducers CAV 2026
- Mata: A Fast and Simple Finite Automata Library TACAS 2024
- Model Counting for Recursively-Defined Strings CAV 2017
- Solving string constraints with Regex-dependent functions through transducers with priorities and variables POPL 2022