Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic

Details Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic

1999-10-14

arxiv.org/abs/cs/9910014v2

Computer Science

Logic in Computer Science

46 pages

Scientific paper

The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification. We can exploit characteristics of the formulas describing the verification conditions to greatly simplify the propositional formulas generated. In particular, we exploit the property that many equations appear only in positive form. We can therefore reduce the set of interpretations of the function symbols that must be considered to prove that a formula is universally valid to those that are ``maximally diverse.'' We present experimental results demonstrating the efficiency of this approach when verifying pipelined processors using the method proposed by Burch and Dill.

Affiliated with

Also associated with

No associations

Rating

Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179584