23-24 September 2017, Brasilia, Brazil
The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms.
The progress in computer-aided reasoning, both automated and interactive, during the past decades, made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and also collaboration between HOL Light and Isabelle in the formal proof of the Kepler conjecture.
Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools to exchange problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation and communication methods, standards, protocols, and programming interfaces. The workshop welcomes the interested developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are also interested both in success stories and in descriptions of the current bottlenecks and proposals for improvement.
Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are:
Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop.
Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class. Papers should be submitted via EasyChair, at the PxTP'2017 workshop page. Accepted regular papers will appear in an EPTCS volume.
Registration to PxTP is part of the Tableaux/FroCoS/ITP registration process.
Saturday, 23 September 2017
Analyzing logics, analyzing theories, and analyzing proofs
Haniel Barbosa, Jasmin Christian Blanchette and Pascal Fontaine
Scalable Fine-Grained Proofs for Formula Processing
Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui and Pascal Fontaine
Language and proofs for Higher-order SMT (work in progress)
Tomer Libal and Xaviera Steele
Determinism in the Certification of UNSAT Proofs
Eunice Palmeira, Fred Freitas and Jens Otten
Converting ALC Connection Proofs into ALC Sequents
Giselle Reis and Bruno Woltzenlogel Paleo
Complexity of Translations from Resolution to Sequent Calculus
Dennis Müller, Colin Rothgang, Yufei Liu and Florian Rabe
Alignment-based Translations Across Formal Systems Using Interface Theories
|17:30-18:15||PxTP Business Meeting|
Sunday, 24 September 2017
Increasing automation in Coq via trustworthy cooperation with external automated reasoners
An extensible ad hoc interface between Lean and Mathematica
Silvio Ghilardi and Elena Pagani
Counter Simulations via Higher Order Quantifier Elimination: a preliminary report