Micaela Mayero

According to our database1, Micaela Mayero authored at least 22 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2022
A Coq Formalization of Lebesgue Integration of Nonnegative Functions.
J. Autom. Reason., 2022

Lebesgue Induction and Tonelli's Theorem in Coq.
CoRR, 2022

2018
Formal proof of polynomial-time complexity with quasi-interpretations.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017
A Coq formal proof of the LaxMilgram theorem.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2015
Formally Verified Certificate Checkers for Hardest-to-Round Computation.
J. Autom. Reason., 2015

2014
Trusting computations: A mechanized proof from partial differential equations to actual program.
Comput. Math. Appl., 2014

2013
Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program.
J. Autom. Reason., 2013

Certified, Efficient and Sharp Univariate Taylor Models in COQ.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

2012
Rigorous Polynomial Approximation Using Taylor Models in Coq.
Proceedings of the NASA Formal Methods, 2012

2011
Wave Equation Numerical Resolution: Mathematics and Program
CoRR, 2011

2010
Coloured Petri net refinement specification and correctness proof with Coq.
Innov. Syst. Softw. Eng., 2010

Formal Proof of a Wave Equation Resolution Scheme: The Method Error.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

Formal Proof of SCHUR Conjugate Function.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2008
Experimenting Formal Proofs of Petri Nets Refinements.
Proceedings of the 13th BAC-FACS Refinement Workshop, 2008

2006
The Three Gap Theorem (Steinhauss Conjecture)
CoRR, 2006

2005
Dealing with algebraic expressions over a field in Coq using Maple.
J. Symb. Comput., 2005

Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System.
Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, 2005

Diophantus' 20th Problem and Fermat's Last Theorem for n=4: Formalization of Fermat's Proofs in the Coq Proof Assistant
CoRR, 2005

2002
Using Theorem Proving for Numerical Analysis (Correctness Proof of an Automatic Differentiation Algorithm).
Proceedings of the Theorem Proving in Higher Order Logics, 15th International Conference, 2002

2001
Field, une procédure de décision pour les nombres réels en Coq.
Proceedings of the Journées francophones des langages applicatifs (JFLA'01), 2001

1999
The Three Gap Theorem (Steinhaus Conjecture).
Proceedings of the Types for Proofs and Programs, 1999


  Loading...