Boolean Satisfiability with Transitivity Constraints

This publication has 11 references indexed in Scilit:

• Techniques for verifying superscalar microprocessors
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• GRASP: a search algorithm for propositional satisfiability
  IEEE Transactions on Computers, 1999
• Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
  Published by Springer Nature ,1999
• The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
  Published by Springer Nature ,1999
• BDD based procedures for a theory of equality with uninterpreted functions
  Published by Springer Nature ,1998
• Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
  Published by Springer Nature ,1997
• Automatic verification of pipelined microprocessor control
  Published by Springer Nature ,1994
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Computing the Minimum Fill-In is NP-Complete
  SIAM Journal on Algebraic Discrete Methods, 1981
• Triangulated graphs and the elimination process
  Journal of Mathematical Analysis and Applications, 1970