Learn More
The logic of equality with uninterpreted functions has been proposed for verifying abstract hardware designs. The ability to perform fast satisfiability checking over this logic is imperative for such verification paradigms to be successful. We present symbolic methods for satisfiability checking for this logic. The first procedure is based on restricting(More)
The logic of equality with uninterpreted functions has been proposed for verifying abstract hardware designs. The ability to perform fast satissability checking over this logic is imperative for this veriication paradigm to be successful. We present symbolic methods for satissability checking for this logic. The rst procedure is based on restricting(More)
  • 1