![Theoretical computer science / Formal methods / Logic in computer science / Electronic design automation / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Solver / Formal equivalence checking / Formal verification / Model checking / Uclid Theoretical computer science / Formal methods / Logic in computer science / Electronic design automation / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Solver / Formal equivalence checking / Formal verification / Model checking / Uclid](https://www.pdfsearch.io/img/99bf1fa7432ab66bb40b7f219a373b8e.jpg) Date: 2010-10-30 02:14:08Theoretical computer science Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean algebra Boolean satisfiability problem Solver Formal equivalence checking Formal verification Model checking Uclid | | Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction
Document is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 41,61 KB |