Back to Results
First PageMeta Content
Theoretical computer science / Logic in computer science / Formal methods / Computational complexity theory / Mathematics / Electronic design automation / NP-complete problems / Constraint programming / Satisfiability modulo theories / Boolean satisfiability problem / Z3 / Solver


Solving Constraints over Bit-Vectors with SAT-based Model Checking Extended Abstract Yakir Vizel1 , Alexander Nadel2 , and Sharad Malik1 2
Add to Reading List

Document Date: 2017-09-02 14:08:49


Open Document

File Size: 279,80 KB

Share Result on Facebook
UPDATE