Jasmin Blanchette

Orcid: 0000-0002-8367-0936

Affiliations:
  • Ludwig Maximilian University of Munich, Germany
  • Max Planck Institute for Informatics, Saarbrücken, Germany
  • University of Lorraine, Nancy, France
  • Vrije Universiteit Amsterdam, The Netherlands (former)
  • Technical University of Munich, Germany (former)


According to our database1, Jasmin Blanchette authored at least 98 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Complete and Efficient Higher-Order Reasoning via Lambda-Superposition.
ACM SIGLOG News, October, 2023

Unifying Splitting.
J. Autom. Reason., June, 2023

Superposition for Higher-Order Logic.
J. Autom. Reason., March, 2023

SAT-Inspired Eliminations for Superposition.
ACM Trans. Comput. Log., January, 2023

SAT-Inspired Higher-Order Eliminations.
Log. Methods Comput. Sci., 2023

Closure Properties of Unrestricted Grammars - Formally Verified.
CoRR, 2023

Mechanical Mathematicians.
Commun. ACM, 2023

Given Clause Loops.
Arch. Formal Proofs, 2023

Extending a High-Performance Prover to Higher-Order Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Closure Properties of General Grammars - Formally Verified.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Recurrence-Driven Summations in Automated Deduction.
Proceedings of the Frontiers of Combining Systems - 14th International Symposium, 2023

Verified Given Clause Procedures.
Proceedings of the Automated Deduction - CADE 29, 2023

2022
Extending a brainiac prover to lambda-free higher-order logic.
Int. J. Softw. Tools Technol. Transf., 2022

A Comprehensive Framework for Saturation Theorem Proving.
J. Autom. Reason., 2022

Making Higher-Order Superposition Work.
J. Autom. Reason., 2022

Seventeen Provers Under the Hammer.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2021
Superposition for Lambda-Free Higher-Order Logic.
Log. Methods Comput. Sci., 2021

Message from the New Editor-in-Chief.
J. Autom. Reason., 2021

Superposition with Lambdas.
J. Autom. Reason., 2021

FMM Preface.
Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

A modular Isabelle framework for verifying saturation provers.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

A Unifying Splitting Framework.
Proceedings of the Automated Deduction - CADE 28, 2021

Superposition for Full Higher-order Logic.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover.
J. Autom. Reason., 2020

Scalable Fine-Grained Proofs for Formula Processing.
J. Autom. Reason., 2020

Extensions to the Comprehensive Framework for Saturation Theorem Proving.
Arch. Formal Proofs, 2020

2019
Introduction to the STAF 2015 special section.
Softw. Syst. Model., 2019

Bindings as bounded natural functors.
Proc. ACM Program. Lang., 2019

Selected Extended Papers of ITP 2016: Preface.
J. Autom. Reason., 2019

A Formal Proof of the Expressiveness of Deep Learning.
J. Autom. Reason., 2019

A verified prover based on ordered resolution.
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk).
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality.
J. Autom. Reason., 2018

Introduction to Milestones in Interactive Theorem Proving.
J. Autom. Reason., 2018

A Verified Functional Implementation of Bachmair and Ganzinger's Ordered Resolution Prover.
Arch. Formal Proofs, 2018

Formalization of Bachmair and Ganzinger's Ordered Resolution Prover.
Arch. Formal Proofs, 2018

A verified SAT solver with watched literals using imperative HOL.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

Superposition with Datatypes and Codatatypes.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
A Decision Procedure for (Co)datatypes in SMT Solvers.
J. Autom. Reason., 2017

Soundness and Completeness Proofs by Coinductive Methods.
J. Autom. Reason., 2017

Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371).
Dagstuhl Reports, 2017

Language and Proofs for Higher-Order SMT (Work in Progress).
Proceedings of the Fifth Workshop on Proof eXchange for Theorem Proving, 2017

Operations on Bounded Natural Functors.
Arch. Formal Proofs, 2017

Abstract Soundness.
Arch. Formal Proofs, 2017

Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Foundational nonuniform (Co)datatypes for higher-order logic.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic.
Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

A Lambda-Free Higher-Order Recursive Path Order.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants.
Proceedings of the Programming Languages and Systems, 2017

Towards Strong Higher-Order Automation for Fast Interactive Verification.
Proceedings of the ARCADE 2017, 2017

A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms.
Proceedings of the Automated Deduction - CADE 26, 2017

Scalable Fine-Grained Proofs for Formula Processing.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
Hammering towards QED.
J. Formaliz. Reason., 2016

A Learning-Based Fact Selector for Isabelle/HOL.
J. Autom. Reason., 2016

Semi-intelligible Isar Proofs from Machine-Generated Proofs.
J. Autom. Reason., 2016

Extending Nunchaku to Dependent Type Theory.
Proceedings of the Proceedings First International Workshop on Hammers for Type Theories, 2016

Encoding Monomorphic and Polymorphic Types.
Log. Methods Comput. Sci., 2016

Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms.
Arch. Formal Proofs, 2016

Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals.
Arch. Formal Proofs, 2016

Formalization of Knuth-Bendix Orders for Lambda-Free Higher-Order Terms.
Arch. Formal Proofs, 2016

Model Finding for Recursive Functions in SMT.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015
Information from Deduction: Models and Proofs (Dagstuhl Seminar 15381).
Dagstuhl Reports, 2015

Foundational Extensible Corecursion.
CoRR, 2015

Mining the Archive of Formal Proofs.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2015

Foundational extensible corecursion: a proof assistant perspective.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Witnessing (Co)datatypes.
Proceedings of the Programming Languages and Systems, 2015

2014
Abstract Completeness.
Arch. Formal Proofs, 2014

Truly Modular (Co)datatypes for Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Cardinals in Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Experience report: the next 1100 Haskell programmers.
Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

My Life with an Automatic Theorem Prover.
Proceedings of the 1st and 2nd Vampire Workshops, Vampire@VSL 2014, 2014

Unified Classical Logic Completeness - A Coinductive Pearl.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions.
Softw. Qual. J., 2013

Extending Sledgehammer with SMT Solvers.
J. Autom. Reason., 2013

LEO-II and Satallax on the Sledgehammer test bench.
J. Appl. Log., 2013

Sound and Complete Sort Encodings for First-Order Logic.
Arch. Formal Proofs, 2013

MaSh: Machine Learning for Sledgehammer.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Mechanizing the Metatheory of Sledgehammer.
Proceedings of the Frontiers of Combining Systems, 2013

Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs.
Proceedings of the Third International Workshop on Proof Exchange for Theorem Proving, 2013

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism.
Proceedings of the Automated Deduction - CADE-24, 2013

Redirecting Proofs by Contradiction.
Proceedings of the Third International Workshop on Proof Exchange for Theorem Proving, 2013

2012
Automatic proofs and refutations for higher-order logic.
PhD thesis, 2012

Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

2011
Monotonicity Inference for Higher-Order Formulas.
J. Autom. Reason., 2011

Nitpicking C++ concurrency.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Automatic Proof and Disproof in Isabelle/HOL.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers.
Proceedings of the 8th International Workshop on the Implementation of Logics, 2010

Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod.
Proceedings of the Short papers for 17th International Conference on Logic for Programming, 2010

Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

2009
Proof Pearl: Mechanizing the Textbook Proof of Huffman's Algorithm.
J. Autom. Reason., 2009

2008
Intra-Object versus Inter-Object: Concurrency and Reasoning in Creol.
Proceedings of the 2nd International Workshop on Harnessing Theories for Tool Support in Software, 2008

The Textbook Proof of Huffman's Algorithm.
Arch. Formal Proofs, 2008

C++ GUI Programming with Qt 4, 2nd Edition.
Pearson Education, ISBN: 978-0-13-235416-5, 2008

2007
An Open System Operational Semantics for an Object-Oriented and Component-Based Language.
Proceedings of the 4th International Workshop on Formal Aspects of Component Software, 2007

2006
C++ GUI programming with Qt 4.
Prentice Hall, ISBN: 0131872494, 2006


  Loading...