Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

This publication has 48 references indexed in Scilit:

• Combinational profiles of sequential benchmark circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Faster SAT and smaller BDDs via common function structure
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Multi-resolution on compressed sets of clauses
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Boolean satisfiability with transitivity constraints
  ACM Transactions on Computational Logic, 2002
• Validating the intel pentium 4 microprocessor
  Published by Association for Computing Machinery (ACM) ,2001
• Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
  ACM Transactions on Computational Logic, 2001
• Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
  Published by Springer Nature ,2000
• Techniques for verifying superscalar microprocessors
  Published by Association for Computing Machinery (ACM) ,1996
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986