30 papers:
FoSSaCS-2015-HabermehlK #on the #quantifier- On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
FM-2014-LakshmiAK #analysis #liveness #reachability #using- Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis (KVL, AA, RK), pp. 335–350.
LICS-CSL-2014-Haase #subclass- Subclasses of presburger arithmetic and the weak EXP hierarchy (CH), p. 10.
ICALP-v2-2013-Woods #generative- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (KW), pp. 410–421.
- LICS-2013-Leroux
- Presburger Vector Addition Systems (JL), pp. 23–32.
VMCAI-2011-BrilloutKRW #quantifier- Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (AB, DK, PR, TW), pp. 88–102.
IJCAR-2010-BrilloutKRW #calculus #quantifier- An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic (AB, DK, PR, TW), pp. 384–399.
TACAS-2009-LerouxP #named- TaPAS: The Talence Presburger Arithmetic Suite (JL, GP), pp. 182–185.
- LICS-2009-Leroux #induction #invariant #problem #reachability
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
CADE-2007-KuncakR #algebra #performance #satisfiability #towards- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (VK, MCR), pp. 215–230.
- IJCAR-2006-DemriL #logic
- Presburger Modal Logic Is PSPACE-Complete (SD, DL), pp. 541–556.
ASE-2005-ZhangC #performance #query- Efficient temporal-logic query checking for presburger systems (DZ, RC), pp. 24–33.
- CADE-2005-KuncakNR #algebra #algorithm
- An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic (VK, HHN, MCR), pp. 260–277.
- LICS-2005-Leroux #diagrams #polynomial #synthesis
- A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams (JL), pp. 147–156.
CC-2004-ParkerC #algorithm- An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas (EP, SC), pp. 104–119.
CAV-2004-KroeningOSS #satisfiability- Abstraction-Based Satisfiability Solving of Presburger Arithmetic (DK, JO, SAS, OS), pp. 308–320.
- LICS-2004-Klaedtke #automaton #on the
- On the Automata Size for Presburger Arithmetic (FK), pp. 110–119.
- LICS-2004-SeshiaB #bound #quantifier #using
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.
CIAA-2001-BoigelotL #equation- Counting the Solutions of Presburger Equations without Enumerating Them (BB, LL), pp. 40–51.
DAC-1998-AmonBL #using- Making Complex Timing Relationships Readable: Presburger Formula Simplicication Using Don’t Cares (TA, GB, JL), pp. 586–590.
- CAV-1998-ComonJ #analysis #automaton #multi #safety
- Multiple Counters Automata, Safety Analysis and Presburger Arithmetic (HC, YJ), pp. 268–279.
- CAV-1998-ShipleKR #comparison #reachability
- A Comparison of Presburger Engines for EFSM Reachability (TRS, JHK, RKR), pp. 280–292.
- DAC-1997-AmonBHL #diagrams #using #verification
- Symbolic Timing Verification of Timing Diagrams using Presburger Formulas (TA, GB, TH, JL), pp. 226–231.
- CAV-1997-BultanGP #infinity #model checking #using
- Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic (TB, RG, WP), pp. 400–411.
SAS-1995-WolperB #approach #constraints- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) (PW, BB), pp. 21–32.
PLDI-1994-Pugh #how #why- Counting Solutions to Presburger Formulas: How and Why (WP), pp. 121–134.
PLILP-1990-Fribourg #execution #prolog- A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution (LF), pp. 174–188.
CSL-1990-CantoneCS #problem #set- Decision Problems for Tarski and Presburger Arithmetics Extended With Sets (DC, VC, JTS), pp. 95–109.
STOC-1978-ReddyL #bound #quantifier- Presburger Arithmetic with Bounded Quantifier Alternation (CRR, DWL), pp. 320–325.
- STOC-1973-Oppen #bound
- Elementary Bounds for Presburger Arithmetic (DCO), pp. 34–37.
