Alethe: Towards a Generic SMT Proof Format (extended abstract)

07/06/2021
by   Hans-Jörg Schurr, et al.
0

The first iteration of the proof format used by the SMT solver veriT was presented ten years ago at the first PxTP workshop. Since then the format has matured. veriT proofs are used within multiple applications, and other solvers generate proofs in the same format. We would now like to gather feedback from the community to guide future developments. Towards this, we review the history of the format, present our pragmatic approach to develop the format, and also discuss problems that might arise when other solvers use the format.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2017

Language and Proofs for Higher-Order SMT (Work in Progress)

Satisfiability modulo theories (SMT) solvers have throughout the years b...
research
09/20/2021

A Flexible Proof Format for SAT Solver-Elaborator Communication

We introduce FRAT, a new proof format for unsatisfiable SAT problems, an...
research
05/05/2020

Making Isabelle Content Accessible in Knowledge Representation Formats

The libraries of proof assistants like Isabelle, Coq, HOL are notoriousl...
research
12/12/2019

The Extended HOA Format for Synthesis

We propose a small extension to the Hanoi Omega-Automata format to defin...
research
01/26/2022

VLDB 2021: Designing a Hybrid Conference

In 2020, while main database conferences one by one had to adopt a virtu...
research
01/02/2021

Three Proofs that the Square Root of 2 Is Irrational

This short article gives three proofs that √ 2 is irrational. The articl...
research
03/28/2023

Specification-based CSV Support in VDM

CSV is a widely used format for data representing systems control, infor...

Please sign up or login with your details

Forgot password? Click here to reset