According to our database1, Laurence Rideau
Legend:Book In proceedings Article PhD thesis Other
Distant Decimals of π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation.
J. Autom. Reasoning, 2018
Distant decimals of $π$.
Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016
Formal Proofs of Transcendence for e and $π$ as an Application of Multivariate and Symmetric Polynomials.
Certified, Efficient and Sharp Univariate Taylor Models in COQ.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013
A Machine-Checked Proof of the Odd Order Theorem.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013
Rigorous Polynomial Approximation Using Taylor Models in Coq.
Proceedings of the NASA Formal Methods, 2012
Incidence Simplicial Matrices Formalized in Coq/SSReflect.
Proceedings of the Intelligent Computer Mathematics - 18th Symposium, 2011
Packaging Mathematical Structures.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves.
J. Autom. Reasoning, 2008
A Modular Formalisation of Finite Group Theory.
Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007
TEXmacs as Authoring Tool for Formal Developments.
Electr. Notes Theor. Comput. Sci., 2004
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001
CtCoq: an environment for mathematical reasoning.
ACM SIGSAM Bulletin, 1999
Towards a multi-formalism framework for architectural synthesis: the ASAR project.
Proceedings of the Third International Workshop on Hardware/Software Codesign, 1994