@MISC{Pichardie12proofexchange, author = {David Pichardie and Tjark Weber}, title = {Proof Exchange for Theorem Proving — Second}, year = {2012} }

Share

OpenURL

Abstract

Proceedings Edited by David Pichardie and Tjark WeberCopyright c ○ 2012 for the individual papers by the papers ’ authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors. Preface The goal of the PxTP workshop series is to bring together researchers working on proof production from automated theorem provers with potential consumers of proofs. Machine-checkable proofs have been proposed for applications like proof-carrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning systems. For example, interactive theorem provers can import results from otherwise untrusted high-performance solvers, by means of proofs the solvers produce. In such situations, one automated reasoning tool can make use of the results of another, without having to trust that the second tool is sound. It is only necessary to be able to reconstruct a proof that the first tool will accept, in order to import the result without increasing the size of the trusted computing base. This simple idea of proof exchange for theorem proving becomes quite complicated under the real-world constraints of highly complex and heterogeneous proof producers and proof consumers. For example, even the issue of a standard proof format for a single class of solvers, like SMT solvers, is quite difficult to address, as different solvers use different inference systems. It may be quite challenging, from an engineering and possibly also theoretical point of view, to fit these into a single standard format. Emerging work from several groups proposes standard meta-languages or parametrised formats to achieve flexibility while retaining a universal proof language.