Model Counting for Recursively-Defined Strings
Abstract elided by the publisher.
Related papers
- Automata-Based Model Counting for String Constraints CAV 2015
- Progressive Reasoning over Recursively-Defined Strings CAV 2016
- A model counter for constraints over unbounded strings PLDI 2014
- Proactive Synthesis of Recursive Tree-to-String Functions from Examples ECOOP 2017
- On Recursion in Graded Modal Type Theory ICFP 2026
- Parikh's Theorem Made Symbolic POPL 2024
- String solving with word equations and transducers: towards a logic for analysing mutation XSS POPL 2016
- Newly-single and loving it: improving higher-order must-alias analysis with heap fragments ICFP 2021