A Bit-Vector Solver with Word-Level Propagation

Abstract

Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have proposed an interesting approach to bit-vector constraint propagation on the word level. Each of the operations except comparison are constant time, assuming the bit-vector fits in a machine word. In contrast, bitvector SMT solvers… (More)
DOI: 10.1007/978-3-319-33954-2_27

Topics

4 Figures and Tables

Slides referencing similar topics