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...
Prif Awduron: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Awduron Eraill: | Jhala, R |
Fformat: | Conference item |
Cyhoeddwyd: |
Springer
2011
|
Eitemau Tebyg
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
gan: Brillout, A, et al.
Cyhoeddwyd: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
gan: Brillout, A, et al.
Cyhoeddwyd: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
gan: Chistikov, D, et al.
Cyhoeddwyd: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
gan: Kuncak, Viktor
Cyhoeddwyd: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
gan: Kroening, D, et al.
Cyhoeddwyd: (2004)