Computer Science – Logic in Computer Science
Scientific paper
2004-02-03
Computer Science
Logic in Computer Science
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.
Matlin Olga Shumsky
McCune William
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-546371