An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
No abstract available.
Related papers
- Counting Solutions to Presburger Formulas: How and Why PLDI 1994
- Parikh's Theorem Made Symbolic POPL 2024
- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) SAS 1995
- A logic you can count on POPL 2004
- Formally Certified Approximate Model Counting CAV 2024
- Multiple Counters Automata, Safety Analysis and Presburger Arithmetic CAV 1998
- Exact Analysis of the Cache Behavior of Nested Loops PLDI 2001
- Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic VMCAI 2019