Beyond quantifier-free interpolation in extensions of presburger arithmetic
Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii) uninterpreted functions (QPA+UF) and (iii) extensional arrays (QPA...
Main Authors: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Other Authors: | Jhala, R |
Format: | Conference item |
Published: |
Springer
2011
|
Similar Items
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
by: Brillout, A, et al.
Published: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
by: Brillout, A, et al.
Published: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
by: Chistikov, D, et al.
Published: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
by: Kuncak, Viktor
Published: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
by: Kroening, D, et al.
Published: (2004)