Martin Desharnais

Orcid: 0000-0002-1830-7532

According to our database1, Martin Desharnais authored at least 15 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The CADE-29 Automated Theorem Proving System Competition - CASC-29.
AI Commun., 2024

Abstract Substitution.
Arch. Formal Proofs, 2024

A Modular Formalization of Superposition in Isabelle/HOL.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

2023
The Next Generation of Deduction Systems: From Composition to Compositionality (Dagstuhl Seminar 23471).
Dagstuhl Reports, 2023

The 11th IJCAR automated theorem proving system competition - CASC-J11.
AI Commun., 2023

A Formalization of the SCL(FOL) Calculus: Simple Clause Learning for First-Order Logic.
Arch. Formal Proofs, 2023

An Isabelle/HOL Formalization of the SCL(FOL) Calculus.
Proceedings of the Automated Deduction - CADE 29, 2023

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

2021
The CADE-28 Automated Theorem Proving System Competition - CASC-28.
AI Commun., 2021

Abstract: Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant.
Proceedings of the 19th International Workshop on Satisfiability Modulo Theories co-located with 33rd International Conference on Computer Aided Verification(CAV 2021), 2021

Towards efficient and verified virtual machines for dynamic languages.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Inline Caching and Unboxing Optimization for Interpreters.
Arch. Formal Proofs, 2020

A Generic Framework for Verified Compilers.
Arch. Formal Proofs, 2020

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


  Loading...