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 |
---|---|
מחברים אחרים: | Jhala, R |
פורמט: | Conference item |
יצא לאור: |
Springer
2011
|
פריטים דומים
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
מאת: Brillout, A, et al.
יצא לאור: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
מאת: Brillout, A, et al.
יצא לאור: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
מאת: Chistikov, D, et al.
יצא לאור: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
מאת: Kuncak, Viktor
יצא לאור: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
מאת: Kroening, D, et al.
יצא לאור: (2004)