Affiliated with the 27th International Conference on Automated Deduction (CADE-27)
26 August 2019, Natal, 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 automatic and interactive, during the past decades, has 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 collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture.
Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools for exchanging 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 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 interested both in success stories and descriptions of 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'2019 workshop page. Accepted regular papers will appear in an EPTCS volume.
|Abstract submission:||May 12, 2019|
|Paper submission:||May 19, 2019|
|Author notification:||June 21, 2019|
|Camera ready version due:||July 21, 2019|
|Workshop:||26 August, 2019|
Monday, 26 August 2019
Systems for Doing Mathematics by Computer
Mathias Fleury and Hans-Jörg Schurr
Reconstructing veriT Proofs in Isabelle/HOL
Mohamed Yacine El Haddad, Guillaume Burel and Frédéric Blanqui
EKSTRAKTO A tool to reconstruct proofs from TSTP traces in Dedukti
Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar and Clark Barrett
DRAT-based Bit-Vector Proofs in CVC4
Learning from Tactic Steps in Formal Proofs
Jieying Chen, Ghadah Abdulrahman S Alghamdi, Renate A. Schmidt, Dirk Walther and Yongsheng Gao
Modularity Meets Forgetting: A Case Study with the SNOMED CT Ontology
Burak Ekici, Arjun Viswanathan, Yoni Zohar, Clark Barrett and Cesare Tinelli
Verifying Bit-vector Invertibility Conditions in Coq
Fadil Kallat, Tristan Schäfer and Anna Vasileva
CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories
Eunice Palmeira Silva, Fred Freitas and Jens Otten
Converting ALC Connection Proofs into ALC Sequents
|18:00-18:45||PxTP Business Meeting|