Olivier Hermant

Orcid: 0000-0001-6233-1903

According to our database1, Olivier Hermant authored at least 32 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Generic Deskolemization Strategy.
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

Numeric Base Conversion with Rewriting.
Proceedings of the LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024, 2024

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

2020
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice.
J. Autom. Reason., 2020

2019
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018
Polarized Rewriting and Tableaux in B Set Theory.
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.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Complétude en Logiques.
, 2017

2016
Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed Study.
Proceedings of the Advances in Knowledge Discovery and Management, 2016

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

Normalisation by Completeness with Heyting Algebras.
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.
Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

Managing Big Data with Information Flow Control.
Proceedings of the 8th IEEE International Conference on Cloud Computing, 2015

2014
Computing Invariants with Transformers: Experimental Scalability and Accuracy.
Proceedings of the Fifth International Workshop on Numerical and Symbolic Abstract Domains, 2014

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

2013
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Polarizing Double-Negation Translations.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Semantic A-translations and Super-Consistency Entail Classical Cut Elimination.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Programming Robots with Events.
Proceedings of the Embedded Systems: Design, Analysis and Verification, 2013

Using Event-Based Style for Developing M2M Applications.
Proceedings of the Grid and Pervasive Computing - 8th International Conference, 2013

2012
A Simple Proof that Super-Consistency Implies Cut Elimination.
Notre Dame J. Formal Log., 2012

A Semantic Proof that Reducibility Candidates entail Cut Elimination.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

The λΠ-calculus Modulo as a Universal Proof Language.
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.
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.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Dynamic Adaptation through Event Reconfiguration.
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.
J. Log. Comput., 2010

Resolution is Cut-Free.
J. Autom. Reason., 2010

2008
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006
On Constructive Cut Admissibility in Deduction Modulo.
Proceedings of the Types for Proofs and Programs, International Workshop, 2006

A Semantic Completeness Proof for TaMeD.
Proceedings of the Logic for Programming, 2006

2005
Semantic Cut Elimination in the Intuitionistic Sequent Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005


  Loading...