Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 37-53
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Bit-Level Abstraction in the Verification of Pipelined Microprocessors by Correspondence Checking1998
- Computing reachable control states of systems modeled with uninterpreted functions and infinite memory1998
- BDD based procedures for a theory of equality with uninterpreted functions1998
- Mechanically checking a lemma used in an automatic verification tool1996
- Verification using uninterpreted functions and finite instantiations1996
- Techniques for verifying superscalar microprocessors1996
- Automatic verification of pipelined microprocessor control1994
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Proof of correctness of data representationsActa Informatica, 1972