Publications Book chapters (13) Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant Author(s): Hans-Jörg Schurr, Mathias Fleury, Martin Desharnais Published in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Issue 12699, 2021, Page(s) 450-467, ISBN 978-3-030-79875-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-79876-5_26 Quantifier Simplification by Unification in SMT Author(s): Pascal Fontaine, Hans-Jörg Schurr Published in: Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8–10, 2021, Proceedings, Issue 12941, 2021, Page(s) 232-249, ISBN 978-3-030-86204-6 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-86205-3_13 A Comprehensive Framework for Saturation Theorem Proving Author(s): Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette Published in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Issue 12166, 2020, Page(s) 316-334, ISBN 978-3-030-51073-2 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-51074-9_18 Superposition with First-class Booleans and Inprocessing Clausification Author(s): Visa Nummelin, Alexander Bentkamp, Sophie Tourret, Petar Vukmirović Published in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Issue 12699, 2021, Page(s) 378-395, ISBN 978-3-030-79875-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-79876-5_22 Maintaining a Library of Formal Mathematics Author(s): Floris van Doorn, Gabriel Ebner, Robert Y. Lewis Published in: Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings, Issue 12236, 2020, Page(s) 251-267, ISBN 978-3-030-53517-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-53518-6_16 Superposition for Full Higher-order Logic Author(s): Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović Published in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Issue 12699, 2021, Page(s) 396-412, ISBN 978-3-030-79875-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-79876-5_23 Extending a Brainiac Prover to Lambda-Free Higher-Order Logic Author(s): Petar Vukmirović, Jasmin Christian Blanchette, Simon Cruanes, Stephan Schulz Published 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, Issue 11427, 2019, Page(s) 192-210, ISBN 978-3-030-17461-3 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-17462-0_11 Superposition with Lambdas Author(s): Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann Published in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Issue 11716, 2019, Page(s) 55-73, ISBN 978-3-030-29435-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-29436-6_4 Faster, Higher, Stronger: E 2.3 Author(s): Stephan Schulz, Simon Cruanes, Petar Vukmirović Published in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Issue 11716, 2019, Page(s) 495-507, ISBN 978-3-030-29435-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-29436-6_29 Extending SMT Solvers to Higher-Order Logic Author(s): Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, Clark Barrett Published in: Automated Deduction – CADE 27 - 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Issue 11716, 2019, Page(s) 35-54, ISBN 978-3-030-29435-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-29436-6_3 Making Higher-Order Superposition Work Author(s): Petar Vukmirović, Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Visa Nummelin, Sophie Tourret Published in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Issue 12699, 2021, Page(s) 415-432, ISBN 978-3-030-79875-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-79876-5_24 A Unifying Splitting Framework Author(s): Gabriel Ebner, Jasmin Blanchette, Sophie Tourret Published in: Automated Deduction – CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings, Issue 12699, 2021, Page(s) 344-360, ISBN 978-3-030-79875-8 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-79876-5_20 Politeness for the Theory of Algebraic Datatypes Author(s): Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett Published in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I, Issue 12166, 2020, Page(s) 238-255, ISBN 978-3-030-51073-2 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-51074-9_14 Peer reviewed articles (11) Superposition for Lambda-Free Higher-Order Logic Author(s): Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Uwe Waldmann Published in: Logic in Computer Science, Issue 17(2), 2021, ISSN 1860-5974 Publisher: Technischen Universitat Braunschweig DOI: 10.23638/lmcs-17(2:1)2021 Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover Author(s): Anders Schlichtkrull, Jasmin Blanchette, Dmitriy Traytel, Uwe Waldmann Published in: Journal of Automated Reasoning, Issue 64/7, 2020, Page(s) 1169-1195, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-020-09561-0 Superposition with Lambdas Author(s): Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann Published in: Journal of Automated Reasoning, Issue 65/7, 2021, Page(s) 893-940, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-021-09595-y Soundness and Completeness Proofs by Coinductive Methods Author(s): Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel Published in: Journal of Automated Reasoning, Issue 58/1, 2017, Page(s) 149-179, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-016-9391-3 NP-completeness of small conflict set generation for congruence closure Author(s): Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo Published in: Formal Methods in System Design, Issue 51/3, 2017, Page(s) 533-544, ISSN 0925-9856 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10703-017-0283-x A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Author(s): Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach Published in: Journal of Automated Reasoning, Issue 61/1-4, 2018, Page(s) 333-365, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-018-9455-7 Bindings as bounded natural functors Author(s): Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, Dmitriy Traytel Published in: Proceedings of the ACM on Programming Languages, Issue 3/POPL, 2019, Page(s) 1-34, ISSN 2475-1421 Publisher: ACM DOI: 10.1145/3290335 A Formal Proof of the Expressiveness of Deep Learning Author(s): Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow Published in: Journal of Automated Reasoning, Issue 63/2, 2019, Page(s) 347-368, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-018-9481-5 Reconstructing veriT Proofs in Isabelle/HOL Author(s): Mathias Fleury, Hans-Jörg Schurr Published in: Electronic Proceedings in Theoretical Computer Science, Issue 301, 2019, Page(s) 36-50, ISSN 2075-2180 Publisher: Open Publishing Association DOI: 10.4204/EPTCS.301.6 Politeness and Combination Methods for Theories with Bridging Functions Author(s): Paula Chocron, Pascal Fontaine, Christophe Ringeissen Published in: Journal of Automated Reasoning, Issue 64/1, 2020, Page(s) 97-134, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-019-09512-4 Scalable Fine-Grained Proofs for Formula Processing Author(s): Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine Published in: Journal of Automated Reasoning, Issue 64/3, 2020, Page(s) 485-510, ISSN 0168-7433 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10817-018-09502-y Conference proceedings (30) A modular Isabelle framework for verifying saturation provers Author(s): Sophie Tourret, Jasmin Blanchette Published in: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Page(s) 224-237, ISBN 9781450382991 Publisher: ACM DOI: 10.1145/3437992.3439912 Efficient full higher-order unification Author(s): Petar Vukmirović, Alexander Bentkamp, Visa Nummelin Published in: 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 Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik DOI: 10.4230/lipics.fscd.2020.5 Efficient Full Higher-Order Unification Author(s): Vukmirovic, Petar; Bentkamp, Alexander; Nummelin, Visa; Ariola, Zena M. Published in: Logical Methods in Computer Science, 2020 Publisher: Technical University of Braunschweig DOI: 10.5281/zenodo.4269591 SAT-inspired eliminations for superposition Author(s): Petar Vukmirović, Jasmin Blanchette, Marijn J.H. Heule Published in: 21st International Conference on Formal Methods in Computer-Aided Design (FMCAD 2021), 2021 Publisher: IEEE DOI: 10.34727/2021/isbn.978-3-85448-046-4_32 Formalizing the ring of Witt vectors Author(s): Johan Commelin, Robert Y. Lewis Published in: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021, Page(s) 264-277, ISBN 9781450382991 Publisher: ACM DOI: 10.1145/3437992.3439919 Foundational nonuniform (Co)datatypes for higher-order logic Author(s): Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12, ISBN 978-1-5090-3018-7 Publisher: IEEE DOI: 10.1109/lics.2017.8005071 Friends with benefits: Implementing corecursion in foundational proof assistants Author(s): Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, Dmitriy Traytel Published in: 26th European Symposium on Programming (ESOP 2017), 2017, Page(s) 111-140 Publisher: Springer Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL Author(s): Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel Published in: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), 2017 Publisher: Schloss Dagstuhl A Formal Proof of the Expressiveness of Deep Learning Author(s): Alexander Bentkamp, Jasmin Christian Blanchette, Dietrich Klakow Published in: 8th Conference on Interactive Theorem Proving (ITP 2017), 2017, Page(s) 46-64 Publisher: Springer A lambda-free higher-order recursive path order Author(s): Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand Published in: 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), 2017, Page(s) 461-479 Publisher: Springer A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Author(s): Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach Published in: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017, Page(s) 4786-4790, ISBN 9780-999241103 Publisher: International Joint Conferences on Artificial Intelligence Organization DOI: 10.24963/ijcai.2017/667 A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms Author(s): Heiko Becker, Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand Published in: 26th International Conference on Automated Deduction (CADE-26), 2017, Page(s) 432-453 Publisher: Springer Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic Author(s): 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 Published in: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Page(s) 3-21 Publisher: Springer DOI: 10.5281/zenodo.3228084 Scalable Fine-Grained Proofs for Formula Processing Author(s): Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine Published in: 26th International Conference on Automated Deduction (CADE-26), 2017, Page(s) 398-412 Publisher: Springer Language and proofs for higher-order SMT (work in progress) Author(s): Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine Published in: 5th Workshop on Proof eXchange for Theorem Proving (PxTP 2017), 2017, Page(s) 15-22 Publisher: Open Publishing Association Congruence closure with free variables Author(s): Haniel Barbosa, Pascal Fontaine, Andrew Reynolds Published in: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2017), Part II, 2017, Page(s) 214-230 Publisher: Springer Subtropical satisfiability Author(s): Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Tung Vu Published in: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 2017, Page(s) 189-206 Publisher: Springer Towards Strong Higher-Order Automation for Fast Interactive Verification Author(s): Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann Published in: EPiC Series in Computing volume 51, 2017, Page(s) 16-7 Publisher: EasyChair DOI: 10.29007/3ngx Superposition with Datatypes and Codatatypes Author(s): Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard Published in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 370-387 Publisher: Springer International Publishing DOI: 10.1007/978-3-319-94205-6_25 Superposition for Lambda-Free Higher-Order Logic Author(s): Alexander Bentkamp, Jasmin Christian Blanchette, Simon Cruanes, Uwe Waldmann Published in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 28-46 Publisher: Springer International Publishing DOI: 10.1007/978-3-319-94205-6_3 A verified SAT solver with watched literals using imperative HOL Author(s): Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich Published in: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018, Page(s) 158-171, ISBN 9781-450355865 Publisher: ACM Press DOI: 10.1145/3167080 Formalizing Bachmair and Ganzinger's ordered resolution prover Author(s): Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel, Uwe Waldmann Published in: 9th International Joint Conference on Automated Reasoning (IJCAR 2018), 2018, Page(s) 89-107 Publisher: Springer International Publishing DOI: 10.1007/978-3-319-94205-6_7 Revisiting Enumerative Instantiation Author(s): Andrew Reynolds, Haniel Barbosa, Pascal Fontaine Published in: 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018), 2018, Page(s) 112-131 Publisher: Springer International Publishing DOI: 10.1007/978-3-319-89963-3_7 Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT Author(s): Pascal Fontaine, Mizuhito Ogawa, Van Khanh To, Xuan Tung Vu Published in: SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom, 2018 Publisher: http://ceur-ws.org A verified prover based on ordered resolution Author(s): Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel Published in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 152-165, ISBN 9781-450362221 Publisher: ACM Press DOI: 10.1145/3293880.3294100 Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk) Author(s): Jasmin Christian Blanchette Published in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 1-13, ISBN 9781-450362221 Publisher: ACM Press DOI: 10.1145/3293880.3294087 Formalizing the Solution to the Cap Set Problem Author(s): Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis Published in: 10th International Conference on Interactive Theorem Proving (ITP 2019), 2019, ISBN 978-3-95977-122-1 Publisher: 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 Author(s): Robert Y. Lewis Published in: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019, 2019, Page(s) 15-26, ISBN 9781-450362221 Publisher: ACM Press DOI: 10.1145/3293880.3294089 Alethe: Towards a Generic SMT Proof Format (extended abstract) Author(s): Hans-Jörg Schurr; Mathias Fleury; Haniel Barbosa; Pascal Fontaine Published in: Workshop on Proof eXchange for Theorem Proving (PxTP), 2021 Publisher: Open Publishing Association DOI: 10.4204/eptcs.336.6 The lean mathematical library Author(s): The mathlib Community Published in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Issue 2020, 2020, Page(s) 367-381, ISBN 9781450370974 Publisher: ACM DOI: 10.1145/3372885.3373824 Searching for OpenAIRE data... There was an error trying to search data from OpenAIRE No results available
