diff options
| -rw-r--r-- | README.md | 9 | ||||
| -rw-r--r-- | README.org | 1 |
2 files changed, 1 insertions, 9 deletions
@@ -1,17 +1,8 @@ -- [BitEQ](#orged8a59e) - - [Difficulties of using Coq for bitvector proofs](#orga4f0f39) - - - -<a id="orged8a59e"></a> - # BitEQ Reasoning about bit equality for various rewrites. This is based on [proofs](resources/samc.lisp) done in ACL2, and uses the `bbv` library to convert the proofs into Coq. -<a id="orga4f0f39"></a> - ## Difficulties of using Coq for bitvector proofs The main difficulty of using Coq for bitvector proofs is that the standard library is missing many proofs about numbers that have the form `x mod 2 ^ y`. These are crucial for bitvector arithmetic, but have to all be manually proven. One example of such a proof is the following Lemma. @@ -1,5 +1,6 @@ #+title: BitEQ #+author: Yann Herklotz +#+options: toc:nil * BitEQ |