Fast Interactive Verification through Strong Higher-Order Automation

Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant

Auteurs: Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais
Publié dans: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numéro 12699, 2021, Page(s) 450-467, ISBN 978-3-030-79875-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_26

Quantifier Simplification by Unification in SMT

Auteurs: Pascal Fontaine, Hans-Jörg Schurr
Publié dans: Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8–10, 2021, Proceedings, Numéro 12941, 2021, Page(s) 232-249, ISBN 978-3-030-86204-6
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-86205-3_13

A Comprehensive Framework for Saturation Theorem Proving

Auteurs: Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette
Publié dans: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numéro 12166, 2020, Page(s) 316-334, ISBN 978-3-030-51073-2
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_18

Superposition with First-class Booleans and Inprocessing Clausification

Auteurs: Visa Nummelin, Alexander Bentkamp, Sophie Tourret, Petar Vukmirović
Publié dans: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numéro 12699, 2021, Page(s) 378-395, ISBN 978-3-030-79875-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_22

Maintaining a Library of Formal Mathematics

Auteurs: Floris van Doorn, Gabriel Ebner, Robert Y. Lewis
Publié dans: Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings, Numéro 12236, 2020, Page(s) 251-267, ISBN 978-3-030-53517-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-53518-6_16

Superposition for Full Higher-order Logic

Auteurs: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović
Publié dans: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numéro 12699, 2021, Page(s) 396-412, ISBN 978-3-030-79875-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_23

Extending a Brainiac Prover to Lambda-Free Higher-Order Logic

Auteurs: Petar Vukmirović, Jasmin Christian Blanchette, Simon Cruanes, Stephan Schulz
Publié dans: Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part I, Numéro 11427, 2019, Page(s) 192-210, ISBN 978-3-030-17461-3
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-17462-0_11

Superposition with Lambdas

Auteurs: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann
Publié dans: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numéro 11716, 2019, Page(s) 55-73, ISBN 978-3-030-29435-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_4

Faster, Higher, Stronger: E 2.3

Auteurs: Stephan Schulz, Simon Cruanes, Petar Vukmirović
Publié dans: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numéro 11716, 2019, Page(s) 495-507, ISBN 978-3-030-29435-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_29

Extending SMT Solvers to Higher-Order Logic

Auteurs: Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, Clark Barrett
Publié dans: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numéro 11716, 2019, Page(s) 35-54, ISBN 978-3-030-29435-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_3

Making Higher-Order Superposition Work

Auteurs: Petar Vukmirović, Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Visa Nummelin, Sophie Tourret
Publié dans: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numéro 12699, 2021, Page(s) 415-432, ISBN 978-3-030-79875-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_24

A Unifying Splitting Framework

Auteurs: Gabriel Ebner, Jasmin Blanchette, Sophie Tourret
Publié dans: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numéro 12699, 2021, Page(s) 344-360, ISBN 978-3-030-79875-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_20

Politeness for the Theory of Algebraic Datatypes

Auteurs: Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett
Publié dans: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numéro 12166, 2020, Page(s) 238-255, ISBN 978-3-030-51073-2
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_14

The Embedding Path Order for Lambda-Free Higher-Order Terms

Auteurs: Alexander Bentkamp
Publié dans: Journal of Applied Logics, 2021, ISSN 2631-9829
Éditeur: IfCoLog

Superposition for Lambda-Free Higher-Order Logic

Auteurs: Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Uwe Waldmann
Publié dans: Logic in Computer Science, Numéro 17(2), 2021, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:1)2021

Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover

Auteurs: Anders Schlichtkrull, Jasmin Blanchette, Dmitriy Traytel, Uwe Waldmann
Publié dans: Journal of Automated Reasoning, Numéro 64/7, 2020, Page(s) 1169-1195, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-020-09561-0

Superposition with Lambdas

Auteurs: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann
Publié dans: Journal of Automated Reasoning, Numéro 65/7, 2021, Page(s) 893-940, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-021-09595-y

Soundness and Completeness Proofs by Coinductive Methods

Auteurs: Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
Publié dans: Journal of Automated Reasoning, Numéro 58/1, 2017, Page(s) 149-179, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-016-9391-3

NP-completeness of small conflict set generation for congruence closure

Auteurs: Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo
Publié dans: Formal Methods in System Design, Numéro 51/3, 2017, Page(s) 533-544, ISSN 0925-9856
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10703-017-0283-x

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Auteurs: Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach
Publié dans: Journal of Automated Reasoning, Numéro 61/1-4, 2018, Page(s) 333-365, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9455-7

Bindings as bounded natural functors

Auteurs: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, Dmitriy Traytel
Publié dans: Proceedings of the ACM on Programming Languages, Numéro 3/POPL, 2019, Page(s) 1-34, ISSN 2475-1421
Éditeur: ACM
DOI: 10.1145/3290335

A Formal Proof of the Expressiveness of Deep Learning

Auteurs: Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow
Publié dans: Journal of Automated Reasoning, Numéro 63/2, 2019, Page(s) 347-368, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9481-5

Reconstructing veriT Proofs in Isabelle/HOL

Auteurs: Mathias Fleury, Hans-Jörg Schurr
Publié dans: Electronic Proceedings in Theoretical Computer Science, Numéro 301, 2019, Page(s) 36-50, ISSN 2075-2180
Éditeur: Open Publishing Association
DOI: 10.4204/EPTCS.301.6

Politeness and Combination Methods for Theories with Bridging Functions

Auteurs: Paula Chocron, Pascal Fontaine, Christophe Ringeissen
Publié dans: Journal of Automated Reasoning, Numéro 64/1, 2020, Page(s) 97-134, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-019-09512-4

Scalable Fine-Grained Proofs for Formula Processing

Auteurs: Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine
Publié dans: Journal of Automated Reasoning, Numéro 64/3, 2020, Page(s) 485-510, ISSN 0168-7433
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-09502-y

A modular Isabelle framework for verifying saturation provers

Auteurs: Sophie Tourret, Jasmin Blanchette
Publié dans: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Page(s) 224-237, ISBN 9781450382991
Éditeur: ACM
DOI: 10.1145/3437992.3439912

Efficient full higher-order unification

Auteurs: Petar Vukmirović, Alexander Bentkamp, Visa Nummelin
Publié dans: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), 2020, Page(s) 5:1--5:17, ISBN 978-3-95977-155-9
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fscd.2020.5

Efficient Full Higher-Order Unification

Auteurs: Vukmirovic, Petar; Bentkamp, Alexander; Nummelin, Visa; Ariola, Zena M.
Publié dans: Logical Methods in Computer Science, 2020
Éditeur: Technical University of Braunschweig
DOI: 10.5281/zenodo.4269591

SAT-inspired eliminations for superposition

Auteurs: Petar Vukmirović, Jasmin Blanchette, Marijn J.H. Heule
Publié dans: 21st International Conference on Formal Methods in Computer-Aided Design (FMCAD 2021), 2021
Éditeur: IEEE
DOI: 10.34727/2021/isbn.978-3-85448-046-4_32

Formalizing the ring of Witt vectors

Auteurs: Johan Commelin, Robert Y. Lewis
Publié dans: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Page(s) 264-277, ISBN 9781450382991
Éditeur: ACM
DOI: 10.1145/3437992.3439919

Foundational nonuniform (Co)datatypes for higher-order logic

Auteurs: Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel
Publié dans: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12, ISBN 978-1-5090-3018-7
Éditeur: IEEE
DOI: 10.1109/lics.2017.8005071

Friends with benefits: Implementing corecursion in foundational proof assistants

Auteurs: Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, Dmitriy Traytel
Publié dans: 26th European Symposium on Programming (ESOP 2017), 2017, Page(s) 111-140
Éditeur: Springer

Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL

Auteurs: Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel
Publié dans: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), 2017
Éditeur: Schloss Dagstuhl

A Formal Proof of the Expressiveness of Deep Learning

Auteurs: Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow
Publié dans: 8th Conference on Interactive Theorem Proving (ITP 2017), 2017, Page(s) 46-64
Éditeur: Springer

A lambda-free higher-order recursive path order

Auteurs: Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand
Publié dans: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017, Page(s) 461-479
Éditeur: Springer

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Auteurs: Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach
Publié dans: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017, Page(s) 4786-4790, ISBN 9780-999241103
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2017/667

A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms

Auteurs: Heiko Becker, Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand
Publié dans: 26th International Conference on Automated Deduction (CADE-26), 2017, Page(s) 432-453
Éditeur: Springer

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

Auteurs: Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondřej Kunčar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel
Publié dans: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Page(s) 3-21
Éditeur: Springer
DOI: 10.5281/zenodo.3228084

Scalable Fine-Grained Proofs for Formula Processing

Auteurs: Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine
Publié dans: 26th International Conference on Automated Deduction (CADE-26), 2017, Page(s) 398-412
Éditeur: Springer

Language and proofs for higher-order SMT (work in progress)

Auteurs: Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine
Publié dans: 5th Workshop on Proof eXchange for Theorem Proving (PxTP 2017), 2017, Page(s) 15-22
Éditeur: Open Publishing Association

Congruence closure with free variables

Auteurs: Haniel Barbosa, Pascal Fontaine, Andrew Reynolds
Publié dans: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2017), Part II, 2017, Page(s) 214-230
Éditeur: Springer

Subtropical satisfiability

Auteurs: Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Tung Vu
Publié dans: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Page(s) 189-206
Éditeur: Springer

Towards Strong Higher-Order Automation for Fast Interactive Verification

Auteurs: Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann
Publié dans: EPiC Series in Computing volume 51, 2017, Page(s) 16-7
Éditeur: EasyChair
DOI: 10.29007/3ngx

Superposition with Datatypes and Codatatypes

Auteurs: Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard
Publié dans: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 370-387
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_25

Superposition for Lambda-Free Higher-Order Logic

Auteurs: Alexander Bentkamp, Jasmin Christian Blanchette, Simon Cruanes, Uwe Waldmann
Publié dans: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 28-46
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_3

A verified SAT solver with watched literals using imperative HOL

Auteurs: Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich
Publié dans: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Page(s) 158-171, ISBN 9781-450355865
Éditeur: ACM Press
DOI: 10.1145/3167080

Formalizing Bachmair and Ganzinger's ordered resolution prover

Auteurs: Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel, Uwe Waldmann
Publié dans: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 89-107
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_7

Revisiting Enumerative Instantiation

Auteurs: Andrew Reynolds, Haniel Barbosa, Pascal Fontaine
Publié dans: 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018), 2018, Page(s) 112-131
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-89963-3_7

Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT

Auteurs: Pascal Fontaine, Mizuhito Ogawa, Van Khanh To, Xuan Tung Vu
Publié dans: SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom, 2018
Éditeur: http://ceur-ws.org

A verified prover based on ordered resolution

Auteurs: Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel
Publié dans: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 152-165, ISBN 9781-450362221
Éditeur: ACM Press
DOI: 10.1145/3293880.3294100

Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)

Auteurs: Jasmin Christian Blanchette
Publié dans: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 1-13, ISBN 9781-450362221
Éditeur: ACM Press
DOI: 10.1145/3293880.3294087

Formalizing the Solution to the Cap Set Problem

Auteurs: Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis
Publié dans: 10th International Conference on Interactive Theorem Proving (ITP 2019), 2019, ISBN 978-3-95977-122-1
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.itp.2019.15

A formal proof of Hensel's lemma over the p-adic integers

Auteurs: Robert Y. Lewis
Publié dans: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 15-26, ISBN 9781-450362221
Éditeur: ACM Press
DOI: 10.1145/3293880.3294089

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

Auteurs: Hans-Jörg Schurr; Mathias Fleury; Haniel Barbosa; Pascal Fontaine
Publié dans: Workshop on Proof eXchange for Theorem Proving (PxTP), 2021
Éditeur: Open Publishing Association
DOI: 10.4204/eptcs.336.6

The lean mathematical library

Auteurs: The mathlib Community
Publié dans: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Numéro 2020, 2020, Page(s) 367-381, ISBN 9781450370974
Éditeur: ACM
DOI: 10.1145/3372885.3373824

Publications

Partager cette page

Télécharger