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...
المؤلفون الرئيسيون: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
مؤلفون آخرون: | Jhala, R |
التنسيق: | Conference item |
منشور في: |
Springer
2011
|
مواد مشابهة
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
حسب: Brillout, A, وآخرون
منشور في: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
حسب: Brillout, A, وآخرون
منشور في: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
حسب: Chistikov, D, وآخرون
منشور في: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
حسب: Kuncak, Viktor
منشور في: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
حسب: Kroening, D, وآخرون
منشور في: (2004)