Corpus ID: 231773538

Interpolating bit-vector arithmetic constraints in MCSAT

@inproceedings{GrahamLengrand2019InterpolatingBA,
  title={Interpolating bit-vector arithmetic constraints in MCSAT},
  author={St'ephane Graham-Lengrand and Dejan Jovanovic},
  year={2019}
}
We present an interpolation mechanism for a fragment of bit-vector arithmetic. Given a conjunction of constraints under one existential quantifier, and given an interpretation of its free variables that falsifies it, we produce a quantifier-free interpolant of the constraints and of the interpretation: the interpolant is implied by the constraints and it is still falsified by the interpretation. The interpolant explains why the interpretation does not satisfy the constraints. This can be used… Expand
1 Citations

Figures from this paper

Solving Bitvectors with MCSAT: Explanations from Bits and Pieces
  • PDF

References

SHOWING 1-7 OF 7 REFERENCES
On Intervals and Bounds in Bit-vector Arithmetic
  • 4
  • PDF
A Model-Constructing Satisfiability Calculus
  • 77
  • PDF
Yices 2.2
  • 270
  • PDF
The Satisfiability Modulo Theories Library (SMT-LIB)
  • www.SMT-LIB.org
  • 2010