[1] | Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, and Micaela Mayero. A coq formalization of lebesgue integration of nonnegative functions. J. Autom. Reasoning, 66(2):175--213, 2022. [ bib | http ] |
[2] | Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, and Laurent Théry. Formally verified certificate checkers for hardest-to-round computation. J. Autom. Reasoning, 54(1):1--29, 2015. [ bib | .pdf ] |
[3] | Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, and Pierre Weis. Trusting computations: A mechanized proof from partial differential equations to actual program. Computers & Mathematics with Applications, 68(3):325--352, 2014. [ bib | http ] |
[4] | Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, and Pierre Weis. Wave equation numerical resolution: a comprehensive mechanized proof of a c program. J. Autom. Reasoning, 50(4):423--456, 2013. [ bib | .pdf ] |
[5] | Christine Choppy, Micaela Mayero, and Laure Petrucci. Coloured Petri net refinement specification and correctness proof with Coq. volume 6, pages 195--202, 2010. [ bib | .pdf ] |
[6] | David Delahaye and Micaela Mayero. Dealing with Algebraic Expressions over a Field in Coq using Maple. In Journal of Symbolic Computation: special issue on the integration of automated reasoning and computer algebra systems, volume 39, pages 569--592, 2005. [ bib | .ps.gz ] |
This file was generated by bibtex2html 1.99.