DeepAI AI Chat
Log In Sign Up

Metamath Zero: The Cartesian Theorem Prover

by   Mario Carneiro, et al.

As the usage of theorem prover technology expands, so too does the reliance on correctness of the tools. Metamath Zero is a verification system that aims for simplicity of logic and implementation, without compromising on efficiency of verification. It is formally specified in its own language, and supports a number of translations to and from other proof languages. This paper describes the abstract logic of Metamath Zero, essentially a multi-sorted first order logic, as well as the binary proof format and the way in which it can ensure essentially linear time verification while still being concise and efficient at scale. Metamath Zero currently holds the record for fastest verification of the Metamath library of proofs in ZFC (including 71 of Wiedijk's 100 formalization targets), at less than 200 ms. Ultimately, we intend to use it to verify the correctness of the implementation of the verifier down to binary executable, so it can be used as a root of trust for more complex proof systems.


page 1

page 2

page 3

page 4


Formally Validating a Practical Verification Condition Generator (extended version)

A program verifier produces reliable results only if both the logic used...

Working with first-order proofs and provers

Verifying software correctness has always been an important and complica...

TrABin: Trustworthy Analyses of Binaries

Verification of microkernels, device drivers, and crypto routines requir...

Leroy and Blazy were right: their memory model soundness proof is automatable (Extended Version)

Xavier Leroy and Sandrine Blazy in 2007 conducted a formal verification,...

Intertwining of Complementary Thue-Morse Factors

We consider the positions of occurrences of a factor x and its binary co...

Sound Transpilation from Binary to Machine-Independent Code

In order to handle the complexity and heterogeneity of mod- ern instruct...

Being correct is not enough: efficient verification using robust linear temporal logic

While most approaches in formal methods address system correctness, ensu...