Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Computer-Aided Reasoning: ACL2 Case Studies illustrates how the computer-aided
reasoning system ACL2 can be used in productive and innovative ways to design, build, and …

Boolean satisfiability (SAT) is NP-complete. No known algorithm for SAT is of polynomial
time complexity. Yet, many of the SAT instances generated as a means of solving real-world …

We compare SAT-checkers and decision diagrams on the evalua-tion of Boolean formulas
produced in the formal verification of both correct and buggy versions of superscalar and …

The paper presents a method, called the method of verification by invisible invariants, for the
automatic verification of a large class of parameterized systems. The method is based on the …

Boolean Satisfiability (SAT) is often used as the underlying model for a significant and
increasing number of applications in Electronic Design Automation (EDA) as well as in many …

A Boolean-based router expresses the routing constraints as a Bool? ean function which is
satisfiable if and only if the layout is routable. Compared to traditional routers, Boolean …

The logic of Equality with Uninterpreted Functions (EUF) provides a means of abstracting the
manipulation of data by a processor when verifying the correctness of its control logic. By …

In the verified architecture microprocessor (VAMP) project we have designed, functionally
verified, and synthesized a processor with full DLX instruction set, delayed branch …

We present a method for translating Boolean formulas to CNF by identifying gates with
fanout count of 1, and merging them with their fanout gate to generate a single set of …