Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors
Author:
- M.N. VelevMVM.N. Velev
- 25 May 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 39 references indexed in Scilit:
- SBSAT: a State-Based, BDD-Based Satisfiability Solver2004
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessorsJournal of Symbolic Computation, 2003
- Deductive Verification of Advanced Out-of-Order Microprocessors2003
- Modeling and Verification of Out-of-Order Microprocessors in UCLID2002
- Handling special constructs in symbolic simulation2002
- EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations2001
- Circuit-based Boolean Reasoning2001
- Verifying correct pipeline implementation for microprocessors1997
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- DAGON: technology binding and local optimization by DAG matching1987