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

Please sign up or login with your details

Forgot password? Click here to reset