Corpus ID: 9358709

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
7 Citations
Solving Bitvectors with MCSAT: Explanations from Bits and Pieces
  • PDF
Theory Combination: Beyond Equality Sharing
  • 4
  • PDF
Centralizing equality reasoning in MCSAT
  • 4
  • PDF
Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs
  • PDF

References

SHOWING 1-10 OF 13 REFERENCES
A scalable decision procedure for fixed-width bit-vectors
  • 24
  • PDF
An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors
  • 85
  • PDF
CDCL-inspired Word-level Learning for Bit-vector Constraint Solving
  • 4
  • PDF
On Intervals and Bounds in Bit-vector Arithmetic
  • 4
  • PDF
Satisfiability Modulo Theories and Assignments
  • 16
  • PDF
Graph-Based Algorithms for Boolean Function Manipulation
  • R. Bryant
  • Computer Science
  • IEEE Transactions on Computers
  • 1986
  • 7,515
  • PDF
The design and implementation of the model constructing satisfiability calculus
  • 26
  • PDF
Conflict-Driven Clause Learning SAT Solvers
  • 371
  • PDF
...
1
2
...