Érik Martin-Dorel

21 papers B 5C 2Misc 1Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
Docker-based CI/CD for Rocq/OCaml projects.
CoRR
Érik Martin-Dorel
2025 J jnl
Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users.
J. Autom. Reason.
Ana de Almeida Borges, Annalí Casanueva Artís, Jean-Rémy Falleri, Emilio Jesús Gallego Arias, Érik Martin-Dorel, Karl Palmskog, Alexander Serebrenik, Théo Zimmermann
2023 B conf
Bel-Games: A Formal Theory of Games of Incomplete Information Based on Belief Functions in the Coq Proof Assistant.
ITP
Pierre Pomeret-Coquot, Hélène Fargier, Érik Martin-Dorel
2023 J jnl
Enabling Floating-Point Arithmetic in the Coq Proof Assistant.
J. Autom. Reason.
Érik Martin-Dorel, Guillaume Melquiond, Pierre Roux
2023 B conf
Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users.
ITP
Ana de Almeida Borges, Annalí Casanueva Artís, Jean-Rémy Falleri, Emilio Jesús Gallego Arias, Érik Martin-Dorel, Karl Palmskog, Alexander Serebrenik, Théo Zimmermann
2022 J jnl
Games of incomplete information: A framework based on belief functions.
Int. J. Approx. Reason.
Pierre Pomeret-Coquot, Hélène Fargier, Érik Martin-Dorel
2021 C conf
Games of Incomplete Information: A Framework Based on Belief Functions.
ECSQARU
Hélène Fargier, Érik Martin-Dorel, Pierre Pomeret-Coquot
2019 B conf
Primitive Floats in Coq.
ITP
Guillaume Bertholon, Érik Martin-Dorel, Pierre Roux
2017 B conf
A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations.
CPP
Érik Martin-Dorel, Pierre Roux
2017 — conf
An Existence Theorem of Nash Equilibrium in Coq and Isabelle.
GandALF
Stéphane Le Roux, Érik Martin-Dorel, Jan-Georg Smaus
2016 — conf
A Formal Study of Boolean Games with Random Formulas as Payoff Functions.
TYPES
Érik Martin-Dorel, Sergei Soloviev
2016 J jnl
Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq.
J. Autom. Reason.
Érik Martin-Dorel, Guillaume Melquiond
2015 J jnl
Formally Verified Certificate Checkers for Hardest-to-Round Computation.
J. Autom. Reason.
Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry
2013 Misc conf
Certified, Efficient and Sharp Univariate Taylor Models in COQ.
SYNASC
Érik Martin-Dorel, Laurence Rideau, Laurent Théry, Micaela Mayero, Ioana Pasca
2012 — —
Contributions to the Formal Verification of Arithmetic Algorithms. (Contributions à la vérification formelle d'algorithmes arithmétiques).
Érik Martin-Dorel
2012 — conf
Rigorous Polynomial Approximation Using Taylor Models in Coq.
NASA Formal Methods
Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry
2011 C conf
Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2).
IEEE Symposium on Computer Arithmetic
Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller
2010 — conf
Implementing decimal floating-point arithmetic through binary: Some suggestions.
ASAP
Nicolas Brisebarre, Nicolas Louvet, Érik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux, Milos D. Ercegovac
2010 J jnl
Improved bound for stochastic formal correctness of numerical algorithms.
Innov. Syst. Softw. Eng.
Marc Daumas, David R. Lester, Érik Martin-Dorel, Annick Truffert
2009 B conf
A Formal Theory of Cooperative TU-Games.
MDAI
Marc Daumas, Érik Martin-Dorel, Annick Truffert, Michel Ventou
2009 — conf
Stochastic Formal Methods for Hybrid Systems.
NASA Formal Methods
Marc Daumas, Érik Martin-Dorel, David R. Lester, Annick Truffert