default search action
Micaela Mayero
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Sylvie Boldo, François Clément, David Hamelin, Micaela Mayero, Pierre Rousselin:
Teaching Divisibility and Binomials with Coq. CoRR abs/2404.12676 (2024) - 2023
- [c13]Sylvie Boldo
, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine:
A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem. FM 2023: 39-55 - 2022
- [j6]Sylvie Boldo
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. J. Autom. Reason. 66(2): 175-213 (2022) - [i8]Sylvie Boldo, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine:
Lebesgue Induction and Tonelli's Theorem in Coq. CoRR abs/2202.05040 (2022) - 2021
- [i7]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. CoRR abs/2104.05256 (2021)
2010 – 2019
- 2018
- [c12]Hugo Férée
Formal proof of polynomial-time complexity with quasi-interpretations. CPP 2018: 146-157 - 2017
- [c11]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq formal proof of the LaxMilgram theorem. CPP 2017: 79-89 - 2015
- [j5]Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry:
Formally Verified Certificate Checkers for Hardest-to-Round Computation. J. Autom. Reason. 54(1): 1-29 (2015) - 2014
- [j4]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond
Trusting computations: A mechanized proof from partial differential equations to actual program. Comput. Math. Appl. 68(3): 325-352 (2014) - 2013
- [j3]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond
Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program. J. Autom. Reason. 50(4): 423-456 (2013) - [c10]Érik Martin-Dorel, Laurence Rideau, Laurent Théry, Micaela Mayero, Ioana Pasca:
Certified, Efficient and Sharp Univariate Taylor Models in COQ. SYNASC 2013: 193-200 - 2012
- [c9]Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller
Rigorous Polynomial Approximation Using Taylor Models in Coq. NASA Formal Methods 2012: 85-99 - [i6]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program. CoRR abs/1212.6641 (2012) - 2011
- [i5]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Wave Equation Numerical Resolution: Mathematics and Program. CoRR abs/1112.1795 (2011) - 2010
- [j2]Christine Choppy, Micaela Mayero, Laure Petrucci
Coloured Petri net refinement specification and correctness proof with Coq. Innov. Syst. Softw. Eng. 6(3): 195-202 (2010) - [c8]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. AISC/MKM/Calculemus 2010: 158-171 - [c7]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond
Formal Proof of a Wave Equation Resolution Scheme: The Method Error. ITP 2010: 147-162 - [i4]Franck Butelle, Florent Hivert, Micaela Mayero, Frédéric Toumazet:
Formal Proof of SCHUR Conjugate Function. CoRR abs/1004.5034 (2010) - [i3]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: the Method Error. CoRR abs/1005.0824 (2010)
2000 – 2009
- 2009
- [c6]Christine Choppy, Micaela Mayero, Laure Petrucci:
Coloured Petri net refinement specification, and correctness proof with Coq. NASA Formal Methods 2009: 156-165 - 2008
- [c5]Christine Choppy, Micaela Mayero, Laure Petrucci
Experimenting Formal Proofs of Petri Nets Refinements. Refine@FM 2008: 231-254 - 2006
- [i2]Micaela Mayero:
The Three Gap Theorem (Steinhauss Conjecture). CoRR abs/cs/0609124 (2006) - 2005
- [j1]David Delahaye, Micaela Mayero:
Dealing with algebraic expressions over a field in Coq using Maple. J. Symb. Comput. 39(5): 569-592 (2005) - [c4]David Delahaye, Micaela Mayero:
Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System. Calculemus 2005: 57-73 - [i1]David Delahaye, Micaela Mayero:
Diophantus' 20th Problem and Fermat's Last Theorem for n=4: Formalization of Fermat's Proofs in the Coq Proof Assistant. CoRR abs/cs/0510011 (2005) - 2002
- [c3]Micaela Mayero:
Using Theorem Proving for Numerical Analysis (Correctness Proof of an Automatic Differentiation Algorithm). TPHOLs 2002: 246-262 - 2001
- [c2]David Delahaye, Micaela Mayero:
Field, une procédure de décision pour les nombres réels en Coq. JFLA 2001: 33-48
1990 – 1999
- 1999
- [c1]Micaela Mayero:
The Three Gap Theorem (Steinhaus Conjecture). TYPES 1999: 162-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: