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)