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...
Príomhchruthaitheoirí: | Brillout, A, Kroening, D, Rümmer, P, Wahl, T |
---|---|
Rannpháirtithe: | Jhala, R |
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
Springer
2011
|
Míreanna comhchosúla
Míreanna comhchosúla
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
de réir: Brillout, A, et al.
Foilsithe / Cruthaithe: (2011) -
An interpolating sequent calculus for quantifier-free Presburger arithmetic
de réir: Brillout, A, et al.
Foilsithe / Cruthaithe: (2011) -
Quantifier elimination for counting extensions of Presburger arithmetic
de réir: Chistikov, D, et al.
Foilsithe / Cruthaithe: (2022) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
de réir: Kuncak, Viktor
Foilsithe / Cruthaithe: (2007) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
de réir: Kroening, D, et al.
Foilsithe / Cruthaithe: (2004)