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...
Principais autores: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Outros Autores: | Jhala, R |
Formato: | Conference item |
Publicado em: |
Springer
2011
|
Registros relacionados
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
por: Brillout, A, et al.
Publicado em: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
por: Brillout, A, et al.
Publicado em: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
por: Chistikov, D, et al.
Publicado em: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
por: Kuncak, Viktor
Publicado em: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
por: Kroening, D, et al.
Publicado em: (2004)