Olivier Hermant

According to our database, Olivier Hermant authored at least 30 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory.

Ali Assaf, Guillaume Burel, Raphaël Cauderlier, David Delahaye, Gilles Dowek, Catherine Dubois, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant, Ronan Saillard

CoRR, 2023

2020

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice.

Guillaume Burel, Guillaume Bury, Raphaël Cauderlier, David Delahaye, Pierre Halmagrand, Olivier Hermant

J. Autom. Reason., 2020

2019

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.

Frédéric Blanqui, Guillaume Genestier, Olivier Hermant

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018

Polarized Rewriting and Tableaux in B Set Theory.

Olivier Hermant

Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, 2018

Runtime Analysis of Whole-System Provenance.

Thomas F. J.-M. Pasquier, Xueyuan Han, Thomas Moyer, Adam Bates, Olivier Hermant, David M. Eyers, Jean Bacon, Margo I. Seltzer

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Complétude en Logiques.

Olivier Hermant

, 2017

2016

Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed Study.

Sathiya Prabhu Kumar, Sylvain Lefebvre, Raja Chiky, Olivier Hermant

Proceedings of the Advances in Knowledge Discovery and Management, 2016

2015

A syntactic soundness proof for free-variable tableaux with on-the-fly Skolemization.

Richard Bonichon, Olivier Hermant

CoRR, 2015

Normalisation by Completeness with Heyting Algebras.

Gaëtan Gilbert, Olivier Hermant

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo.

Guillaume Bury, David Delahaye, Damien Doligez, Pierre Halmagrand, Olivier Hermant

Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

Managing Big Data with Information Flow Control.

Thomas F. J.-M. Pasquier, Jatinder Singh, Jean Bacon, Olivier Hermant

Proceedings of the 8th IEEE International Conference on Cloud Computing, 2015

2014

Computing Invariants with Transformers: Experimental Scalability and Accuracy.

Vivien Maisonneuve, Olivier Hermant, François Irigoin

Proceedings of the Fifth International Workshop on Numerical and Symbolic Abstract Domains, 2014

Semantic A-translation and Super-consistency entail Classical Cut Elimination.

Lisa Allali, Olivier Hermant

CoRR, 2014

2013

Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo.

David Delahaye, Damien Doligez, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Polarizing Double-Negation Translations.

Mélanie Boudard, Olivier Hermant

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Semantic A-translations and Super-Consistency Entail Classical Cut Elimination.

Lisa Allali, Olivier Hermant

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Programming Robots with Events.

Truong Giang Le, Dmitriy Fedosov, Olivier Hermant, Matthieu Manceny, Renaud Pawlak, Renaud Rioboo

Proceedings of the Embedded Systems: Design, Analysis and Verification, 2013

Using Event-Based Style for Developing M2M Applications.

Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak, Renaud Rioboo

Proceedings of the Grid and Pervasive Computing - 8th International Conference, 2013

2012

A Simple Proof that Super-Consistency Implies Cut Elimination.

Gilles Dowek, Olivier Hermant

Notre Dame J. Formal Log., 2012

A Semantic Proof that Reducibility Candidates entail Cut Elimination.

Denis Cousineau, Olivier Hermant

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

The λΠ-calculus Modulo as a Universal Proof Language.

Mathieu Boespflug, Quentin Carbonneaux, Olivier Hermant

Proceedings of the Second International Workshop on Proof Exchange for Theorem Proving, 2012

Unifying Event-based and Rule-based Styles to Develop Concurrent and Context-aware Reactive Applications - Toward a Convenient Support for Concurrent and Reactive Programming.

Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak, Renaud Rioboo

Proceedings of the ICSOFT 2012 - Proceedings of the 7th International Conference on Software Paradigm Trends, Rome, Italy, 24, 2012

2011

Orthogonality and Boolean Algebras for Deduction Modulo.

Aloïs Brunel, Olivier Hermant, Clément Houtmann

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Dynamic Adaptation through Event Reconfiguration.

Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak

Proceedings of the On the Move to Meaningful Internet Systems: OTM 2011 Workshops, 2011

2010

Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2.

Olivier Hermant, James Lipton

J. Log. Comput., 2010

Resolution is Cut-Free.

Olivier Hermant

J. Autom. Reason., 2010

2008

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.

Olivier Hermant, James Lipton

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006

On Constructive Cut Admissibility in Deduction Modulo.

Richard Bonichon, Olivier Hermant

Proceedings of the Types for Proofs and Programs, International Workshop, 2006

A Semantic Completeness Proof for TaMeD.

Richard Bonichon, Olivier Hermant

Proceedings of the Logic for Programming, 2006

2005

Semantic Cut Elimination in the Intuitionistic Sequent Calculus.

Olivier Hermant

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005