Back to Results
First PageMeta Content
Theoretical computer science / Mathematical logic / Mathematics / Boolean algebra / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Propositional calculus / Model checking


Verification Using SAT and SMT Solvers1 N. Shankar Computer Science Laboratory SRI International Menlo Park, CA
Add to Reading List

Document Date: 2010-08-25 09:00:40


Open Document

File Size: 422,21 KB

Share Result on Facebook
UPDATE