default search action
Laurence Rideau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Vincent Lefèvre
, Nicolas Louvet
Accurate Calculation of Euclidean Norms Using Double-word Arithmetic. ACM Trans. Math. Softw. 49(1): 1:1-1:34 (2023) - 2022
- [j5]Jean-Michel Muller
Formalization of Double-Word Arithmetic, and Comments on "Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic". ACM Trans. Math. Softw. 48(1): 9:1-9:24 (2022)
2010 – 2019
- 2018
- [j4]Yves Bertot
Distant Decimals of π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation. J. Autom. Reason. 61(1-4): 33-71 (2018) - 2017
- [i2]Yves Bertot, Laurence Rideau, Laurent Théry:
Distant decimals of $π$. CoRR abs/1709.01743 (2017) - 2016
- [c10]Sophie Bernard, Yves Bertot, Laurence Rideau, Pierre-Yves Strub:
Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials. CPP 2016: 76-87 - 2015
- [i1]Sophie Bernard, Yves Bertot, Laurence Rideau, Pierre-Yves Strub:
Formal Proofs of Transcendence for e and $π$ as an Application of Multivariate and Symmetric Polynomials. CoRR abs/1512.02791 (2015) - 2013
- [c9]Georges Gonthier, Andrea Asperti
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - [c8]É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
- [c7]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 - 2011
- [c6]Jónathan Heras
Incidence Simplicial Matrices Formalized in Coq/SSReflect. Calculemus/MKM 2011: 30-44 - 2010
- [e1]Serge Autexier
Intelligent Computer Mathematics, 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5-10, 2010. Proceedings. Lecture Notes in Computer Science 6167, Springer 2010, ISBN 978-3-642-14127-0 [contents]
2000 – 2009
- 2009
- [c5]François Garillot
Packaging Mathematical Structures. TPHOLs 2009: 327-342 - 2008
- [j3]Laurence Rideau, Bernard P. Serpette, Xavier Leroy:
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves. J. Autom. Reason. 40(4): 307-326 (2008) - 2007
- [c4]Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry:
A Modular Formalisation of Finite Group Theory. TPHOLs 2007: 86-101 - 2003
- [c3]Philippe Audebaud, Laurence Rideau:
TEXmacs as Authoring Tool for Formal Developments. UITP@TPHOLs 2003: 27-48 - 2002
- [j2]Hanane Naciri, Laurence Rideau:
Affichage et manipulation interactive de formules mathématiques dans les documents structurés. ARIMA J. 1: 5 (2002) - 2001
- [c2]Marc Daumas, Laurence Rideau, Laurent Théry:
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing. TPHOLs 2001: 169-184
1990 – 1999
- 1999
- [j1]Yves Bertot, Laurence Rideau, Loïc Pottier, Laurent Thiry:
CtCoq: an environment for mathematical reasoning. SIGSAM Bull. 33(3): 21-22 (1999) - 1994
- [c1]Michel Auguin, Mohamed Belhadj, Judith Benzakki, C. Carrière, Guy Durrieu, Thierry Gautier, Michel Israël, Paul Le Guernic, Michel Lemaître, E. Martin, Patrice Quinton, Laurence Rideau, Frédéric Rousseau, Olivier Sentieys:
Towards a multi-formalism framework for architectural synthesis: the ASAR project. CODES 1994: 25-32
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-08-05 21:22 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: