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...
Main Authors: | 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, et al.
出版: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
由: Brillout, A, et al.
出版: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
由: Chistikov, D, et al.
出版: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
由: Kuncak, Viktor
出版: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
由: Kroening, D, et al.
出版: (2004)