Encapsulation for Practical Simplification Procedures

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a resolution/paramodulation theorem proving system. Term rewriting is at the core of the two procedures, but details of the rewriting procedure itself are irrelevant. The ACL2 encapsulate construct was used to assert the existence of the rewriting function and to state some of its properties. Termination, irreducibility, and soundness properties were established for each procedure. The availability of the encapsulation mechanism in ACL2 is considered essential to rapid and efficient verification of this kind of algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Encapsulation for Practical Simplification Procedures 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 Encapsulation for Practical Simplification Procedures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encapsulation for Practical Simplification Procedures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-546371

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.