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)