An Alternative to SAT-Based Approaches for Bit-Vectors
From MaRDI portal
Publication:3557070
DOI10.1007/978-3-642-12002-2_7zbMath1284.68379OpenAlexW1598706103MaRDI QIDQ3557070
Philippe Herrmann, Sébastien Bardin, Florian Perroud
Publication date: 27 April 2010
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Sharpening constraint programming approaches for bit-vector theory ⋮ Deciding Bit-Vector Formulas with mcSAT ⋮ Wombit: a portfolio bit-vector solver using word-level propagation ⋮ On the usefulness of linear modular arithmetic in constraint programming
Uses Software
This page was built for publication: An Alternative to SAT-Based Approaches for Bit-Vectors