Abstraction plays a critical role in verifying complex sys-tems. A number of languages have
been proposed to model hardware systems by, primarily, abstracting away their wide …

This paper describes a new algorithm for extracting unsatisfiable subformulas from a given
unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the …

We describe the Reveal formal functional verification system and its application to four
representative hardware test cases. Reveal employs counterexample-guided abstraction …

In this paper we explore the application of Counter example-Guided Abstraction Refinement
(CEGAR) in the context of microprocessor correspondence checking. The approach utilizes …

We describe the application of the Reveal formal functional verification system to six representative
hardware test cases. Reveal employs counterexample-guided abstraction refinement…

We describe the Reveal formal functional verification system and its application to three
representative hardware test cases. Reveal employs counterexample-guided abstraction …

… Zaher Andraus Department of Electrical Engineering and Computer Science University of
Michigan, Ann Arbor October 2004 … Next, we will introduce Vapor’s naming convention for�…

This report describes a strong connection between maximum satisfiability and minimally-unsatisfiable
subformulas of any constraint system, as well as techniques for exploiting it. …

… our system beats the baseline by 10% for the 56 Kb/s tests, and almost 15% for the 28.8
Kb/s tests. … The results show our system outperforms Kroeger’s trie for 100, 56, and 28.8 Kb/s …

Our work addresses the challenge of scaling pre-silicon functional verification of hardware
designs such as microprocessors and microcontrollers. These designs employ wide …