Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions, Theoretical Computer Science, 2004. ,
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237
Modern Computer Algebra, 2003. ,
DOI : 10.1017/CBO9781139856065
Formal Proof?The Four-Color Theorem. Notices of the, pp.1382-1393, 2008. ,
A Small Scale Reflection Extension for the Coq system, INRIA, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00258384
An Ssreflect Tutorial, INRIA, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00407778
A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers ,
DOI : 10.1007/11814771_36
A Computational Approach to Pocklington Certificates in Type Theory, Functional and Logic Programming, pp.97-113, 2006. ,
DOI : 10.1007/11737414_8
Neue Grundlagen der Arithmetik Journal für die reine und angewandte Mathematik (Crelle's Journal), pp.51-84, 1904. ,
The Coq proof assistant: a tutorial: version 8, 2010. ,
A Test for Correctly Rounded SQRT, 1996. ,
Worst cases for correct rounding of the elementary functions in double precision, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.111-118, 2001. ,
DOI : 10.1109/ARITH.2001.930110
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982. ,
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318
Certifying algorithms, Computer Science Review, vol.5, issue.2, 2010. ,
DOI : 10.1016/j.cosrev.2010.09.009
Elementary Functions, Algorithms and Implementation, 2006. ,
URL : https://hal.archives-ouvertes.fr/ensl-00000008
Number-Theoretic Test Generation for Directed Rounding, 14th IEEE Symposium on Computer Arithmetic, pp.241-248, 1999. ,
DOI : 10.1109/12.863034
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.6373
Algorithmique de la réduction des réseaux et application à la recherche de pires cas pour l'arrondi des fonctions mathématiques, 2005. ,
On the Randomness of Bits Generated by Sufficiently Smooth Functions, 7th International Symposium, ANTS-VII, pp.257-274, 2006. ,
DOI : 10.1007/11792086_19
Searching worst cases of a one-variable function using lattice reduction, IEEE Transactions on Computers, vol.54, issue.3, pp.340-346, 2005. ,
DOI : 10.1109/TC.2005.55
Primality Proving with Elliptic Curves, Theorem Proving in Higher Order Logics, pp.319-333, 2007. ,
DOI : 10.1007/978-3-540-74591-4_24