Fast Interactive Verification through Strong Higher-Order Automation

Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant

Autori: Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 450-467, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_26

Quantifier Simplification by Unification in SMT

Autori: Pascal Fontaine, Hans-Jörg Schurr
Pubblicato in: Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8–10, 2021, Proceedings, Numero 12941, 2021, Pagina/e 232-249, ISBN 978-3-030-86204-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-86205-3_13

A Comprehensive Framework for Saturation Theorem Proving

Autori: Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette
Pubblicato in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numero 12166, 2020, Pagina/e 316-334, ISBN 978-3-030-51073-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_18

Superposition with First-class Booleans and Inprocessing Clausification

Autori: Visa Nummelin, Alexander Bentkamp, Sophie Tourret, Petar Vukmirović
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 378-395, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_22

Maintaining a Library of Formal Mathematics

Autori: Floris van Doorn, Gabriel Ebner, Robert Y. Lewis
Pubblicato in: Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings, Numero 12236, 2020, Pagina/e 251-267, ISBN 978-3-030-53517-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-53518-6_16

Superposition for Full Higher-order Logic

Autori: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 396-412, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_23

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

Autori: Petar Vukmirović, Jasmin Christian Blanchette, Simon Cruanes, Stephan Schulz
Pubblicato in: 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, Numero 11427, 2019, Pagina/e 192-210, ISBN 978-3-030-17461-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17462-0_11

Superposition with Lambdas

Autori: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann
Pubblicato in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numero 11716, 2019, Pagina/e 55-73, ISBN 978-3-030-29435-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_4

Faster, Higher, Stronger: E 2.3

Autori: Stephan Schulz, Simon Cruanes, Petar Vukmirović
Pubblicato in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numero 11716, 2019, Pagina/e 495-507, ISBN 978-3-030-29435-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_29

Extending SMT Solvers to Higher-Order Logic

Autori: Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, Clark Barrett
Pubblicato in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Numero 11716, 2019, Pagina/e 35-54, ISBN 978-3-030-29435-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-29436-6_3

Making Higher-Order Superposition Work

Autori: Petar Vukmirović, Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Visa Nummelin, Sophie Tourret
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 415-432, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_24

A Unifying Splitting Framework

Autori: Gabriel Ebner, Jasmin Blanchette, Sophie Tourret
Pubblicato in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Numero 12699, 2021, Pagina/e 344-360, ISBN 978-3-030-79875-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-79876-5_20

Politeness for the Theory of Algebraic Datatypes

Autori: Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett
Pubblicato in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Numero 12166, 2020, Pagina/e 238-255, ISBN 978-3-030-51073-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-51074-9_14

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

Autori: Alexander Bentkamp
Pubblicato in: Journal of Applied Logics, 2021, ISSN 2631-9829
Editore: IfCoLog

Superposition for Lambda-Free Higher-Order Logic

Autori: Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Uwe Waldmann
Pubblicato in: Logic in Computer Science, Numero 17(2), 2021, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:1)2021

Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover

Autori: Anders Schlichtkrull, Jasmin Blanchette, Dmitriy Traytel, Uwe Waldmann
Pubblicato in: Journal of Automated Reasoning, Numero 64/7, 2020, Pagina/e 1169-1195, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-020-09561-0

Superposition with Lambdas

Autori: Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann
Pubblicato in: Journal of Automated Reasoning, Numero 65/7, 2021, Pagina/e 893-940, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-021-09595-y

Soundness and Completeness Proofs by Coinductive Methods

Autori: Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
Pubblicato in: Journal of Automated Reasoning, Numero 58/1, 2017, Pagina/e 149-179, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-016-9391-3

NP-completeness of small conflict set generation for congruence closure

Autori: Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo
Pubblicato in: Formal Methods in System Design, Numero 51/3, 2017, Pagina/e 533-544, ISSN 0925-9856
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10703-017-0283-x

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

Autori: Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach
Pubblicato in: Journal of Automated Reasoning, Numero 61/1-4, 2018, Pagina/e 333-365, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9455-7

Bindings as bounded natural functors

Autori: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, Dmitriy Traytel
Pubblicato in: Proceedings of the ACM on Programming Languages, Numero 3/POPL, 2019, Pagina/e 1-34, ISSN 2475-1421
Editore: ACM
DOI: 10.1145/3290335

A Formal Proof of the Expressiveness of Deep Learning

Autori: Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow
Pubblicato in: Journal of Automated Reasoning, Numero 63/2, 2019, Pagina/e 347-368, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-9481-5

Reconstructing veriT Proofs in Isabelle/HOL

Autori: Mathias Fleury, Hans-Jörg Schurr
Pubblicato in: Electronic Proceedings in Theoretical Computer Science, Numero 301, 2019, Pagina/e 36-50, ISSN 2075-2180
Editore: Open Publishing Association
DOI: 10.4204/EPTCS.301.6

Politeness and Combination Methods for Theories with Bridging Functions

Autori: Paula Chocron, Pascal Fontaine, Christophe Ringeissen
Pubblicato in: Journal of Automated Reasoning, Numero 64/1, 2020, Pagina/e 97-134, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-019-09512-4

Scalable Fine-Grained Proofs for Formula Processing

Autori: Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine
Pubblicato in: Journal of Automated Reasoning, Numero 64/3, 2020, Pagina/e 485-510, ISSN 0168-7433
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10817-018-09502-y

A modular Isabelle framework for verifying saturation provers

Autori: Sophie Tourret, Jasmin Blanchette
Pubblicato in: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Pagina/e 224-237, ISBN 9781450382991
Editore: ACM
DOI: 10.1145/3437992.3439912

Efficient full higher-order unification

Autori: Petar Vukmirović, Alexander Bentkamp, Visa Nummelin
Pubblicato in: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), 2020, Pagina/e 5:1--5:17, ISBN 978-3-95977-155-9
Editore: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fscd.2020.5

Efficient Full Higher-Order Unification

Autori: Vukmirovic, Petar; Bentkamp, Alexander; Nummelin, Visa; Ariola, Zena M.
Pubblicato in: Logical Methods in Computer Science, 2020
Editore: Technical University of Braunschweig
DOI: 10.5281/zenodo.4269591

SAT-inspired eliminations for superposition

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

Formalizing the ring of Witt vectors

Autori: Johan Commelin, Robert Y. Lewis
Pubblicato in: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Pagina/e 264-277, ISBN 9781450382991
Editore: ACM
DOI: 10.1145/3437992.3439919

Foundational nonuniform (Co)datatypes for higher-order logic

Autori: Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel
Pubblicato in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Pagina/e 1-12, ISBN 978-1-5090-3018-7
Editore: IEEE
DOI: 10.1109/lics.2017.8005071

Friends with benefits: Implementing corecursion in foundational proof assistants

Autori: Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, Dmitriy Traytel
Pubblicato in: 26th European Symposium on Programming (ESOP 2017), 2017, Pagina/e 111-140
Editore: Springer

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

Autori: Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel
Pubblicato in: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), 2017
Editore: Schloss Dagstuhl

A Formal Proof of the Expressiveness of Deep Learning

Autori: Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow
Pubblicato in: 8th Conference on Interactive Theorem Proving (ITP 2017), 2017, Pagina/e 46-64
Editore: Springer

A lambda-free higher-order recursive path order

Autori: Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand
Pubblicato in: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017, Pagina/e 461-479
Editore: Springer

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

Autori: Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach
Pubblicato in: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017, Pagina/e 4786-4790, ISBN 9780-999241103
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2017/667

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

Autori: Heiko Becker, Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand
Pubblicato in: 26th International Conference on Automated Deduction (CADE-26), 2017, Pagina/e 432-453
Editore: Springer

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

Autori: 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
Pubblicato in: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Pagina/e 3-21
Editore: Springer
DOI: 10.5281/zenodo.3228084

Scalable Fine-Grained Proofs for Formula Processing

Autori: Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine
Pubblicato in: 26th International Conference on Automated Deduction (CADE-26), 2017, Pagina/e 398-412
Editore: Springer

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

Autori: Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine
Pubblicato in: 5th Workshop on Proof eXchange for Theorem Proving (PxTP 2017), 2017, Pagina/e 15-22
Editore: Open Publishing Association

Congruence closure with free variables

Autori: Haniel Barbosa, Pascal Fontaine, Andrew Reynolds
Pubblicato in: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2017), Part II, 2017, Pagina/e 214-230
Editore: Springer

Subtropical satisfiability

Autori: Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Tung Vu
Pubblicato in: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Pagina/e 189-206
Editore: Springer

Towards Strong Higher-Order Automation for Fast Interactive Verification

Autori: Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann
Pubblicato in: EPiC Series in Computing volume 51, 2017, Pagina/e 16-7
Editore: EasyChair
DOI: 10.29007/3ngx

Superposition with Datatypes and Codatatypes

Autori: Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard
Pubblicato in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Pagina/e 370-387
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_25

Superposition for Lambda-Free Higher-Order Logic

Autori: Alexander Bentkamp, Jasmin Christian Blanchette, Simon Cruanes, Uwe Waldmann
Pubblicato in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Pagina/e 28-46
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_3

A verified SAT solver with watched literals using imperative HOL

Autori: Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich
Pubblicato in: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Pagina/e 158-171, ISBN 9781-450355865
Editore: ACM Press
DOI: 10.1145/3167080

Formalizing Bachmair and Ganzinger's ordered resolution prover

Autori: Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel, Uwe Waldmann
Pubblicato in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Pagina/e 89-107
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_7

Revisiting Enumerative Instantiation

Autori: Andrew Reynolds, Haniel Barbosa, Pascal Fontaine
Pubblicato in: 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018), 2018, Pagina/e 112-131
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-89963-3_7

Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT

Autori: Pascal Fontaine, Mizuhito Ogawa, Van Khanh To, Xuan Tung Vu
Pubblicato in: SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom, 2018
Editore: http://ceur-ws.org

A verified prover based on ordered resolution

Autori: Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel
Pubblicato in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Pagina/e 152-165, ISBN 9781-450362221
Editore: ACM Press
DOI: 10.1145/3293880.3294100

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

Autori: Jasmin Christian Blanchette
Pubblicato in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Pagina/e 1-13, ISBN 9781-450362221
Editore: ACM Press
DOI: 10.1145/3293880.3294087

Formalizing the Solution to the Cap Set Problem

Autori: Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis
Pubblicato in: 10th International Conference on Interactive Theorem Proving (ITP 2019), 2019, ISBN 978-3-95977-122-1
Editore: 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

Autori: Robert Y. Lewis
Pubblicato in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Pagina/e 15-26, ISBN 9781-450362221
Editore: ACM Press
DOI: 10.1145/3293880.3294089

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

Autori: Hans-Jörg Schurr; Mathias Fleury; Haniel Barbosa; Pascal Fontaine
Pubblicato in: Workshop on Proof eXchange for Theorem Proving (PxTP), 2021
Editore: Open Publishing Association
DOI: 10.4204/eptcs.336.6

The lean mathematical library

Autori: The mathlib Community
Pubblicato in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Numero 2020, 2020, Pagina/e 367-381, ISBN 9781450370974
Editore: ACM
DOI: 10.1145/3372885.3373824

Pubblicazioni

Condividi questa pagina

Scarica