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)