<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Proof Exchange for Theorem Proving | Second International Workshop, PxTP 2012</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Manchester</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>UK June</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Jasmin Blanchette, Technische Universitat Munchen, Germany Pascal Fontaine, University of Nancy, France John Harrison, Intel Corporation, USA Leonardo de Moura, Microsoft Research, USA David Pichardie, Inria Rennes, France Pierre-Yves Strub, Inria/Microsoft, France Aaron Stump, The University of Iowa, USA Geo Sutcli e, University of Miami, USA Laurent Thery, Inria Sophia-Antipolis, France Allen Van Gelder, University of California at Santa Cruz, USA Tjark Weber, Uppsala University</institution>
          ,
          <country country="SE">Sweden</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Edited by David Pichardie and Tjark Weber</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Proceedings
Copyright 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.
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 certi ed compilation,
as well as for exchanging knowledge between di erent 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 rst tool will accept, in
order to import the result without increasing the size of the trusted computing base.</p>
      <p>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 di cult to address, as di erent solvers use di erent inference systems.
It may be quite challenging, from an engineering and possibly also theoretical point of view, to
t these into a single standard format. Emerging work from several groups proposes standard
meta-languages or parametrised formats to achieve exibility while retaining a universal proof
language.</p>
      <p>PxTP 2012, the Second International Workshop on Proof Exchange for Theorem Proving,
was held as a satellite event of IJCAR on June 30, 2012, in Manchester, UK. The workshop
featured invited talks by Robert L. Constable and Stephan Merz, a joint session with the Third
Workshop on Practical Aspects of Automated Reasoning (PAAR 2012), and presentations of
the ve accepted papers that are collected in this volume. We would like to thank the IJCAR
organisers, the PxTP program committee, the authors and speakers, and everyone else who
contributed to the workshop's success.</p>
      <p>David Pichardie and Tjark Weber
Co-chairs, PxTP 2012
Program Committee</p>
    </sec>
    <sec id="sec-2">
      <title>Invited Talks</title>
    </sec>
    <sec id="sec-3">
      <title>Contributed Papers</title>
      <p>The</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>Proof Assistants and the Dynamic Nature of Formal</article-title>
          <string-name>
            <surname>Theories . . . . . . . . . . . . . . . . . . . . . . . . . . . . .</surname>
          </string-name>
          1 Robert L. Constable
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Proofs</surname>
          </string-name>
          and
          <article-title>Proof Certi cation in the TLA+ Proof</article-title>
          <string-name>
            <surname>System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .</surname>
          </string-name>
          16 Stephan Merz
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <article-title>LFSC for SMT Proofs: Work in</article-title>
          <string-name>
            <given-names>Progress . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Aaron</given-names>
            <surname>Stump</surname>
          </string-name>
          , Andrew Reynolds, Cesare Tinelli, Austin Laugesen, Harley Eades, Corey Oliver, and
          <article-title>Ruoyu Zhang -calculus Modulo as a Universal Proof</article-title>
          <string-name>
            <surname>Language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>-calculus Modulo 44</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>System</given-names>
            <surname>Feature</surname>
          </string-name>
          <article-title>Description: Importing Refutations into the GAPT</article-title>
          <string-name>
            <given-names>Framework . . . . . . . . . . 51 Cvetan</given-names>
            <surname>Dunchev</surname>
          </string-name>
          , Alexander Leitsch, Tomer Libal, Martin Riener, Mikheil Rukhaia, Daniel Weller, and
          <string-name>
            <surname>Bruno</surname>
          </string-name>
          Woltzenlogel-Paleo
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>Walking through the Forest: Fast EUF Proof-Checking</article-title>
          <string-name>
            <given-names>Algorithms . . . . . . . . . . . . . . . . . . . . . . . 58 Frederic</given-names>
            <surname>Besson</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pierre-Emmanuel Cornilleau</surname>
          </string-name>
          , and Ronan Saillard
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>