<--- Back to Details
First PageDocument Content
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
Date: 2010-10-30 02:14:08
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

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