Skip to main content

Fast Interactive Verification through Strong Higher-Order Automation

Searching for OpenAIRE data...

Publications

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
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

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

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

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

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
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

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
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

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

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

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

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
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
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
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
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
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
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

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
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
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
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
DOI: 10.1145/3293880.3294089

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
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
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
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
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
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
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
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
DOI: 10.1007/s10817-018-09502-y

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
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
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
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
DOI: 10.1007/978-3-030-29436-6_3