An MCSAT treatment of Bit-Vectors (preliminary report)

Abstract : We propose a general scheme for treating the theory of bit-vectors (BV) in the MCSAT framework, complementing the approach by Zeljić, Wintersteiger, and Rümmer. MCSAT assigns values to first-order variables. In order to keep track of the set of feasible values for a given bit-vector variable, we propose the use of Binary Decision Diagram. This allows an assignment mechanism that is generic for BV. When a conflict arises, involving some of the constraints and some of the assignments made so far, MCSAT must produce an explanation for the conflict. This mechanism can be specialized according to the constraints involved in the conflict. We propose an explanation mechanism that applies when these constraints are in the core fragment of BV, based on slicing and equality reasoning. We plan to add support for more BV fragments in the future.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01615837
Contributor : Stéphane Graham-Lengrand <>
Submitted on : Thursday, October 12, 2017 - 5:01:41 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM

File

SMT2017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01615837, version 1

Citation

Stéphane Graham-Lengrand, Dejan Jovanović. An MCSAT treatment of Bit-Vectors (preliminary report). SMT 2017 - 15th International Workshop on Satisfiability Modulo Theories, Jul 2017, Heidelberg, Germany. ⟨hal-01615837⟩

Share

Metrics

Record views

210

Files downloads

58