Bit-Blasting ACL2 Theorems

Details Bit-Blasting ACL2 Theorems Bit-Blasting ACL2 Theorems

2011-10-21

arxiv.org/abs/1110.4676v1

EPTCS 70, 2011, pp. 84-102

Computer Science

Logic in Computer Science

In Proceedings ACL2 2011, arXiv:1110.4473

Scientific paper

10.4204/EPTCS.70.7

Interactive theorem proving requires a lot of human guidance. Proving a property involves (1) figuring out why it holds, then (2) coaxing the theorem prover into believing it. Both steps can take a long time. We explain how to use GL, a framework for proving finite ACL2 theorems with BDD- or SAT-based reasoning. This approach makes it unnecessary to deeply understand why a property is true, and automates the process of admitting it as a theorem. We use GL at Centaur Technology to verify execution units for x86 integer, MMX, SSE, and floating-point arithmetic.

Affiliated with

Also associated with

No associations

Rating

Bit-Blasting ACL2 Theorems 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 Bit-Blasting ACL2 Theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bit-Blasting ACL2 Theorems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84697