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...
Hlavní autoři: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Další autoři: | Jhala, R |
Médium: | Conference item |
Vydáno: |
Springer
2011
|
Podobné jednotky
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
Autor: Brillout, A, a další
Vydáno: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
Autor: Brillout, A, a další
Vydáno: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
Autor: Chistikov, D, a další
Vydáno: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
Autor: Kuncak, Viktor
Vydáno: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
Autor: Kroening, D, a další
Vydáno: (2004)