Olivier Hermant
43
Documents
Presentation
Olivier HERMANT
[CRI](http://cri.mines-paristech.fr)
Mines ParisTech
35 rue Saint-Honoré
77 305 Fontainebleau (France)
Tel: +33 (0)1 64 69 48 31
Olivier HERMANT
[CRI](http://cri.mines-paristech.fr)
Mines ParisTech
35 rue Saint-Honoré
77 305 Fontainebleau (France)
Tel: +33 (0)1 64 69 48 31
Publications
|
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets PracticeJournal of Automated Reasoning, 2020, 64 (6), pp.1001-1050. ⟨10.1007/s10817-019-09533-z⟩
Journal articles
hal-02305831v1
|
|
A simple proof that super consistency implies cut eliminationNotre Dame Journal of Formal Logic, 2012, 53 (4), pp. 93-106. ⟨10.1215/00294527-1722692⟩
Journal articles
hal-00793008v1
|
|
Resolution is Cut-FreeJournal of Automated Reasoning, 2010, 44 (3), pp.245-276. ⟨10.1007/s10817-009-9153-6⟩
Journal articles
hal-00743218v1
|
Completeness and cut elimination in the Intuitionistic Church's Theory of Types-Part 2Journal of Logic and Computation, 2010, Vol. 20 (No 2), pp.597-602
Journal articles
hal-00917868v1
|
|
|
Cut Elimination in the Intuitionistic Theory of Types with Axioms and Rewriting Cuts, ConstructivelyStudies in Logic and te Foundations of Mathematics, 2008, pp 101-134
Journal articles
hal-00912791v1
|
|
Eliminating Cuts in hoI(C ) - Extended AbstractTEASE-LP: Workshop on Trends, Extensions, Applications and Semantics of Logic Programming, May 2020, Paris, France
Conference papers
hal-02958328v1
|
|
Dependency Pairs Termination in Dependent Type Theory Modulo RewritingFSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.9⟩
Conference papers
hal-01943941v4
|
|
Dependency Pairs Termination in Dependent Type Theory Modulo RewritingTYPES 2019 - 25th International Conference on Types for Proofs and Programs, Jun 2019, Oslo, Norway. pp.30-31
Conference papers
hal-02442484v1
|
Runtime Analysis of Whole-System ProvenanceThe 25th ACM Conference on Computer and Communications Security, Oct 2018, Toronto, Canada. pp.1601-1616
Conference papers
hal-01859773v1
|
|
|
Polarized Rewriting and Tableaux in B Set Theory3RD INTERNATIONAL WORKSHOP ABOUT SETS AND TOOLS (SETS 2018), Jun 2018, Southampton, United Kingdom. pp.67-72
Conference papers
hal-01820522v1
|
Not Incompatible Logicsthe GI-Dagstuhl Seminars : Universality of Proofs, Oct 2016, Dagstuhl, Germany
Conference papers
hal-01463138v1
|
|
|
Expressing theories in the λΠ-calculus modulo theory and in the Dedukti systemTYPES: Types for Proofs and Programs, May 2016, Novi SAd, Serbia
Conference papers
hal-01441751v1
|
|
Verification of Faust Signal Processing Programs in COQThe 1st International Workshop on Coq for PL (Co-located with POPL), Jan 2015, Mumbai, India
Conference papers
hal-01108173v1
|
|
Des réels aux flottants : préservation automatique de preuves de stabilité de LyapunovAFADL, Pascale Le Gall; Frederic Dadeau, Jun 2015, Bordeaux, France. pp.51-56
Conference papers
hal-01138327v1
|
|
Normalization by Completeness with Heyting AlgebrasLPAR 20 : 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji
Conference papers
hal-01204599v1
|
|
A Taste of Sound Reasoning in FaustThe Linux Audio Conference (LAC 2015) , Johannes Gutenberg University (JGU), Apr 2015, Mainz, Germany
Conference papers
hal-01251069v1
|
|
Automated Deduction in the B Set Theory using Typed Proof Search and Deduction ModuloLPAR 20 : 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji. pp 42-58
Conference papers
hal-01204701v2
|
|
Managing Big Data with Information Flow Control8th IEEE International Conference on Cloud Computing (CLOUD 2015), Jun 2015, New York, United States
Conference papers
hal-01260014v1
|
|
Computing Invariants with Transformers: Experimental Scalability and AccuracyFifth International Workshop on Numerical and Symbolic Abstract Domains, Sep 2014, Munich, Germany. 14 p., Pages 17-31, ⟨10.1016/j.entcs.2014.08.003⟩
Conference papers
hal-01058298v1
|
|
ALICe: A Framework to Improve Affine Loop Invariant Computationthe 5th International Workshop on Invariant Generation (WING 2014), Jul 2014, Vienne, Austria
Conference papers
hal-01086957v1
|
|
Using Event-Based Style for Developing M2M ApplicationsGPC - 8th International Conference on Grid and Pervasive Computing - 2013, 2013, Seoul, South Korea. pp.348-357, ⟨10.1007/978-3-642-38027-3_37⟩
Conference papers
hal-00924491v1
|
|
Semantic A-translation and Super-consistency entail Classical Cut EliminationLPAR 19 - 19th Conference on Logic for Programming, Artificial Intelligence, and Reasoning - 2013, Bernd Fischer, Geoff Sutcliffe, Dec 2013, Stellenbosch, South Africa. pp.407-422, ⟨10.1007/978-3-642-45221-5_28⟩
Conference papers
hal-00923915v1
|
|
Zenon Modulo: When Achilles Outruns the Tortoise using Deduction ModuloLPAR - Logic for Programming Artificial Intelligence and Reasoning - 2013, Dec 2013, Stellenbosch, South Africa. pp.274-290, ⟨10.1007/978-3-642-45221-5_20⟩
Conference papers
hal-00909784v1
|
|
Polarizing Double Negation TranslationsLPAR, Dec 2013, Stellenbosch, South Africa. pp.182-197
Conference papers
hal-00920224v2
|
|
Programming Robots With Events4th International Embedded Systems Symposium (IESS), Jun 2013, Paderborn, Germany. pp.14-25, ⟨10.1007/978-3-642-38853-8_2⟩
Conference papers
hal-00924489v1
|
|
Proof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter StepsIWIL - 10th International Workshop on the Implementation of Logics - 2013, Dec 2013, Stellenbosch, South Africa
Conference papers
hal-00909688v1
|
|
The λΠ-calculus Modulo as a Universal Proof Languagethe Second International Workshop on Proof Exchange for Theorem Proving (PxTP 2012), Jun 2012, Manchester, United Kingdom. pp. 28-43
Conference papers
hal-00917845v1
|
|
A Semantic Proof that Reducibility Candidates entail Cut EliminationRTA'12 - 23rd International Conference on Rewriting Techniques and Applications, May 2012, Nagoya, Japan. pp.133--148, ⟨10.4230/LIPIcs.RTA.2012.133⟩
Conference papers
hal-00743284v1
|
Unifying Event-based and Rule-based Styles to Develop Concurrent and Context-aware Reactive Applications - Toward a Convenient Support for Concurrent and Reactive ProgramInternational Conference on Software Paradigm Trends, Jul 2012, Rome, Italy. pp.347-350
Conference papers
hal-01126209v1
|
|
|
Simulator Of A "Weather" Cloud10th Finnish-Russian University Cooperation in Telecommunication Workshop (FRUCT), Apr 2012, St.-Petersburg, Russia
Conference papers
hal-00909649v1
|
Dedukti: A Universal Proof CheckerJournées communes LTP - LAC, Oct 2012, Orléans, France
Conference papers
hal-01537578v1
|
|
Unifying Event-based and Rule-based Styles for Concurrent and Reactive ApplicationsThe 7th International Conference on Software Paradigm Trends, ICSOFT 2012, Jul 2012, Rome, Italy. pp.347-350
Conference papers
hal-00829701v1
|
|
|
Dynamic Adaptation through Event ReconfigurationVariability, Adaptation and Dynamism in software systEms and seRvices (VADER 2011), Oct 2011, Hersonissos, Crete, France. pp.637-646
Conference papers
hal-00639556v1
|
|
Dynamic Adaptation through Event Recon gurationWorkshop on Variability, Adaptation and Dynamism in software systEms and seRvices (VADER 2011), Oct 2011, Hersonissos, Crete, Greece
Conference papers
hal-00909684v1
|
A constructive semantic approach to cut elimination in type theories with axiom22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Sep 2008, Bertinoro, Italy. pp 169-183, ⟨10.1007/978-3-540-87531-4_14⟩
Conference papers
hal-00916025v1
|
|
|
A simple proof that super consistency implies cut elimination18th International Conference, RTA 2007, Jun 2007, Paris, France. pp.Pages 93-106, ⟨10.1007/978-3-540-73449-9_9⟩
Conference papers
hal-00743256v1
|
Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed StudyAdvances in Knowledge Discovery and Management, 7, Springer, pp.83-108, 2018, ⟨10.1007/978-3-319-65406-5_4⟩
Book sections
hal-02066058v1
|
|
Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory2016
Preprints, Working Papers, ...
hal-04281492v1
|
|
A syntactic soundness proof for free-variable tableaux with on-the-fly Skolemization2015
Preprints, Working Papers, ...
hal-01154799v1
|
|
Orthogonality and Boolean Algebras for Deduction Modulo2011
Preprints, Working Papers, ...
inria-00563331v1
|
|
A simple proof that super-consistency implies cut elimination2007
Preprints, Working Papers, ...
hal-00150697v1
|
|
Preservation of Lyapunov-Theoretic Proofs: From Real to Floating-Point Arithmetic[Research Report] Mines ParisTech. 2014
Reports
hal-01086732v1
|
|
Complétude en LogiquesInformatique [cs]. Université Paris Diderot (Paris 7), 2017
Habilitation à diriger des recherches
tel-01529422v1
|