An MCSAT treatment of Bit-Vectors (preliminary report)
@inproceedings{GrahamLengrand2017AnMT, title={An MCSAT treatment of Bit-Vectors (preliminary report)}, author={St'ephane Graham-Lengrand and Dejan Jovanovic}, year={2017} }
We propose a general scheme for treating the theory of bit-vectors (BV) in the MCSAT framework, complementing the approach by Zeljic, Wintersteiger, and Rummer. 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… Expand
Figures and Topics from this paper
7 Citations
Theory Combination: Beyond Equality Sharing
- Mathematics, Computer Science
- Description Logic, Theory Combination, and All That
- 2019
- 4
- PDF
References
SHOWING 1-10 OF 13 REFERENCES
A scalable decision procedure for fixed-width bit-vectors
- Computer Science
- 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers
- 2009
- 24
- PDF
An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors
- Mathematics, Computer Science
- CAV
- 1997
- 85
- PDF
CDCL-inspired Word-level Learning for Bit-vector Constraint Solving
- Computer Science, Mathematics
- ArXiv
- 2017
- 4
- PDF
Graph-Based Algorithms for Boolean Function Manipulation
- Computer Science
- IEEE Transactions on Computers
- 1986
- 7,515
- PDF
The design and implementation of the model constructing satisfiability calculus
- Computer Science
- 2013 Formal Methods in Computer-Aided Design
- 2013
- 26
- PDF