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...
Huvudupphovsmän: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Övriga upphovsmän: | Jhala, R |
Materialtyp: | Conference item |
Publicerad: |
Springer
2011
|
Liknande verk
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
av: Brillout, A, et al.
Publicerad: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
av: Brillout, A, et al.
Publicerad: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
av: Chistikov, D, et al.
Publicerad: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
av: Kuncak, Viktor
Publicerad: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
av: Kroening, D, et al.
Publicerad: (2004)