Home > lambdatheultimate > Milawa: A Self-Verifying Theorem Prover for an ACL2-Like Logic

Milawa: A Self-Verifying Theorem Prover for an ACL2-Like Logic

May 29th, 2010 05:49 admin Leave a comment Go to comments

Milawa: A Self-Verifying Theorem Prover for an ACL2-Like Logic

Milawa is a “self-verifying” theorem prover for an ACL2-like logic.

We begin with a simple proof checker, call it A, which is short enough to verify by the “social process” of mathematics.

We then develop a series of increasingly powerful proof checkers, call them B, C, D, and so on. We show that each of these is sound: they accept only the same formulas as A. We use A to verify B, and B to verify C, and so on. Then, since we trust A, and A says B is sound, we can trust B, and so on for C, D, and the rest.

Our final proof checker is really a theorem prover; it can carry out a goal-directed proof search using assumptions, calculation, rewrite rules, and so on. We use this theorem prover to discover the proofs of soundness for B, C, and so on, and to emit these proofs in a format that A can check. Hence, “self verifying.”

This might help inform discussions of the relationship between the de Bruijn criterion (the “social process” of mathematics) and formal verification. I think it also serves as an interesting signpost on the road forward: it’s one thing to say that starting with a de Bruijn core and evolving a more powerful prover is possible in principle; it’s another thing for it to actually have been done. The author’s thesis defense slides provide a nice, quick overview.

Source: Milawa: A Self-Verifying Theorem Prover for an ACL2-Like Logic

Related Articles:

  1. Milawa on Jitawa: a Verified Theorem Prover
  2. Dependently Typed Programming based on Automated Theorem Proving
  3. Dependently Typed Programming based on Automated Theorem Proving
  4. Ask Slashdot: Verifying Security of a Hosted Site?
  5. Verifying a User By Following the Movements of Their Mouse
blog comments powered by Disqus
YOYOYOOYOYOYO