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)