An interpolating sequent calculus for quantifier-free Presburger arithmetic
Craig interpolation has become a versatile tool in formal verification, used for instance to generate program assertions that serve as candidates for loop invariants. In this paper, we consider Craig interpolation for quantifier-free Presburger arithmetic (QFPA). Until recently, quantifier eliminati...
Main Authors: | Brillout, A, Kroening, D, Rümmer, P, al., E |
---|---|
Format: | Journal article |
Izdano: |
Springer
2011
|
Podobne knjige/članki
-
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
od: Brillout, A, et al.
Izdano: (2011) -
Beyond quantifier-free interpolation in extensions of presburger arithmetic
od: Brillout, A, et al.
Izdano: (2011) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
od: Kuncak, Viktor
Izdano: (2007) -
Quantifier elimination for counting extensions of Presburger arithmetic
od: Chistikov, D, et al.
Izdano: (2022) -
Abstraction−based Satisfiability Solving of Presburger Arithmetic
od: Kroening, D, et al.
Izdano: (2004)