Érik Martin-Dorel

According to our database, Érik Martin-Dorel authored at least 18 papers between 2009 and 2023.

Collaborative distances:

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

2023

Enabling Floating-Point Arithmetic in the Coq Proof Assistant.

Érik Martin-Dorel, Guillaume Melquiond, Pierre Roux

J. Autom. Reason., December, 2023

Bel-Games: A Formal Theory of Games of Incomplete Information Based on Belief Functions in the Coq Proof Assistant.

Pierre Pomeret-Coquot, Hélène Fargier, Érik Martin-Dorel

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users.

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

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

2022

Games of incomplete information: A framework based on belief functions.

Pierre Pomeret-Coquot, Hélène Fargier, Érik Martin-Dorel

Int. J. Approx. Reason., 2022

2019

Primitive Floats in Coq.

Guillaume Bertholon, Érik Martin-Dorel, Pierre Roux

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2017

An Existence Theorem of Nash Equilibrium in Coq and Isabelle.

Stéphane Le Roux, Érik Martin-Dorel, Jan-Georg Smaus

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations.

Érik Martin-Dorel, Pierre Roux

Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016

Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq.

Érik Martin-Dorel, Guillaume Melquiond

J. Autom. Reason., 2016

A Formal Study of Boolean Games with Random Formulas as Payoff Functions.

Érik Martin-Dorel, Sergei Soloviev

Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

2015

Formally Verified Certificate Checkers for Hardest-to-Round Computation.

Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry

J. Autom. Reason., 2015

2013

Certified, Efficient and Sharp Univariate Taylor Models in COQ.

Érik Martin-Dorel, Laurence Rideau, Laurent Théry, Micaela Mayero, Ioana Pasca

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

2012

Contributions to the Formal Verification of Arithmetic Algorithms. (Contributions à la vérification formelle d'algorithmes arithmétiques).

Érik Martin-Dorel

PhD thesis, 2012

Rigorous Polynomial Approximation Using Taylor Models in Coq.

Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry

Proceedings of the NASA Formal Methods, 2012

2011

Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2).

Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller

Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010

Improved bound for stochastic formal correctness of numerical algorithms.

Marc Daumas, David R. Lester, Érik Martin-Dorel, Annick Truffert

Innov. Syst. Softw. Eng., 2010

Implementing decimal floating-point arithmetic through binary: Some suggestions.

Nicolas Brisebarre, Nicolas Louvet, Érik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux, Milos D. Ercegovac

Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010

2009

Stochastic Formal Methods for Hybrid Systems.

Marc Daumas, Érik Martin-Dorel, David R. Lester, Annick Truffert

Proceedings of the First NASA Formal Methods Symposium, 2009

A Formal Theory of Cooperative TU-Games.

Marc Daumas, Érik Martin-Dorel, Annick Truffert, Michel Ventou

Proceedings of the Modeling Decisions for Artificial Intelligence, 2009