Conference paper Open Access

Working with first-order proofs and provers

Raskin, Mikhail; Welzel, Christoph

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.

Files (348.2 kB)
Name Size
first-order-proof-handling.pdf
md5:3e0c889375c79d1c8c6da7ec7f041852
348.2 kB Download
54
28
views
downloads
All versions This version
Views 5454
Downloads 2828
Data volume 9.8 MB9.8 MB
Unique views 5252
Unique downloads 2828

Share

Cite as