𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

✍ Scribed by Gopalan, Parikshit; Kolaitis, Phokion G.; Maneva, Elitza; Papadimitriou, Christos H.

Book ID
118180913
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
356 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Effective use of Boolean satisfiability
Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors
✍ Miroslav N Velev; Randal E Bryant πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 477 KB

We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced in the formal verification of both correct and buggy versions of superscalar and VLIW microprocessors. The microprocessors are described in a high-level hardware description language, based on the logic of e