Working with first-order proofs and provers

03/18/2019
by   Michael Raskin, et al.
0

Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming practical. Currently, the most powerful automated proof search tools use first-order logic while popular interactive proof assistants use higher-order logic. We present our work-in-progress set of tools that aim to eventually provide a usable first-order logic computer-assisted proof environment.

READ FULL TEXT
research
04/25/2021

Isabelle's Metalogic: Formalization and Proof Checker

Isabelle is a generic theorem prover with a fragment of higher-order log...
research
09/02/2021

A logic of interactive proofs

We introduce the probabilistic two-agent justification logic IPJ, a logi...
research
03/10/2023

On Exams with the Isabelle Proof Assistant

We present an approach for testing student learning outcomes in a course...
research
12/05/2022

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,...
research
10/02/2017

Proof-checking Euclid

We used computer proof-checking methods to verify the correctness of our...
research
10/22/2019

Metamath Zero: The Cartesian Theorem Prover

As the usage of theorem prover technology expands, so too does the relia...
research
02/20/2023

A modest proposal: explicit support for foundational pluralism

Whilst mathematicians assume classical reasoning principles by default t...

Please sign up or login with your details

Forgot password? Click here to reset