Constraint Satisfaction over Bit-Vectors

  title={Constraint Satisfaction over Bit-Vectors},
  author={Laurent D. Michel and Pascal Van Hentenryck},
Reasoning over bit-vectors arises in a variety of applications in verification and cryptography. This paper presents a bit-vector domain for constraint programming and its associated filtering algorithms. The domain supports all the traditional bit operations and correctly models modulo-arithmetic and overflows. The domain implementation uses bit operations of the underlying architecture, avoiding the drawback of a bit-blasting approach that associates a variable with each bit. The filtering… CONTINUE READING
10 Citations
25 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 25 references

Cryptanalysis of SHA-1 With Constraint Programming Over Bit-Vectors

  • L. Michel, P. Van Hentenryck, G. Johnson
  • In CP’12,
  • 2012
2 Excerpts

Structural testing of executables An alternative to sat - based approaches for bit - vectors

  • Y. Zhu
  • 2010

Similar Papers

Loading similar papers…