Abstraction-Based Satisfiability Solving of Presburger Arithmetic
No abstract available.
Related papers
- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) SAS 1995
- Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic VMCAI 2019
- Parikh's Theorem Made Symbolic POPL 2024
- TaPAS: The Talence Presburger Arithmetic Suite TACAS 2009
- Multiple Counters Automata, Safety Analysis and Presburger Arithmetic CAV 1998
- Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic CAV 1997
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic APLAS 2016
- FPL: fast Presburger arithmetic through transprecision OOPSLA 2021