default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Théry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i9]Laurent Théry:
A Formalisation of Algorithms for Sorting Network. CoRR abs/2203.01579 (2022)- [i8]Laurent Théry, Sophia Antipolis:
Primality Tests and Prime Certificate. CoRR abs/2203.16341 (2022) - [i7]Laurent Théry:
A Formalisation of a Fast Fourier Transform. CoRR abs/2210.05225 (2022) - 2021
- [j8]Florian Steinberg, Laurent Théry, Holger Thies:
Computable analysis and notions of continuity in Coq. Log. Methods Comput. Sci. 17(2) (2021) - [c29]Laurent Théry:
Proof Pearl : Playing with the Tower of Hanoi Formally. ITP 2021: 31:1-31:16
2010 – 2019
- 2019
- [c28]Ran Chen, Cyril Cohen
, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle. ITP 2019: 13:1-13:19 - [c27]Florian Steinberg, Laurent Théry, Holger Thies:
Quantitative Continuity and Computable Analysis in Coq. ITP 2019: 28:1-28:21 - [i6]Florian Steinberg, Laurent Théry, Holger Thies:
Quantitative continuity and computable analysis in Coq. CoRR abs/1904.13203 (2019) - 2018
- [j7]Yves Bertot, Laurence Rideau, Laurent Théry:
Distant Decimals of π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation. J. Autom. Reason. 61(1-4): 33-71 (2018) - [i5]Ran Chen, Cyril Cohen, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle. CoRR abs/1810.11979 (2018) - 2017
- [c26]Arthur Blot, Jean-Michel Muller, Laurent Théry:
Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers. NSV@CAV 2017: 25-37 - [i4]Yves Bertot, Laurence Rideau, Laurent Théry:
Distant decimals of $π$. CoRR abs/1709.01743 (2017) - 2015
- [j6]É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) - [j5]Laurent Théry, Freek Wiedijk:
Foreword to the Special Focus on Formal Proofs for Mathematics and Computer Science. Math. Comput. Sci. 9(1): 1-3 (2015) - 2013
- [c25]Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot, Stéphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Théry:
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - [c24]É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
- [c23]Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry:
Rigorous Polynomial Approximation Using Taylor Models in Coq. NASA Formal Methods 2012: 85-99 - 2011
- [c22]Michaël Armand, Germain Faure, Benjamin Grégoire, Chantal Keller, Laurent Théry, Benjamin Werner:
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses. CPP 2011: 135-150 - [c21]Frédéric Besson, Pascal Fontaine, Laurent Théry:
A Flexible Proof Format for SMT: a Proposal. PxTP 2011: 15-26 - 2010
- [c20]Laurent Fuchs, Laurent Théry:
A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry. Automated Deduction in Geometry 2010: 51-67 - [c19]Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, Laurent Théry:
Extending Coq with Imperative Features and Its Application to SAT Verification. ITP 2010: 83-98
2000 – 2009
- 2009
- [i3]Claude Pasquier, Laurent Théry:
A distributed editing environment for XML documents. CoRR abs/0902.3136 (2009) - 2008
- [c18]Benjamin Grégoire, Loïc Pottier, Laurent Théry:
Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving. Automated Deduction in Geometry 2008: 42-59 - [c17]Laurent Théry:
Proof Pearl: Revisiting the Mini-rubik in Coq. TPHOLs 2008: 310-319 - 2007
- [c16]Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry:
A Modular Formalisation of Finite Group Theory. TPHOLs 2007: 86-101 - [c15]Laurent Théry, Guillaume Hanrot:
Primality Proving with Elliptic Curves. TPHOLs 2007: 319-333 - 2006
- [c14]Benjamin Grégoire, Laurent Théry:
A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers. IJCAR 2006: 423-437 - [c13]Benjamin Grégoire, Laurent Théry, Benjamin Werner:
A Computational Approach to Pocklington Certificates in Type Theory. FLOPS 2006: 97-113 - [p1]Laurent Théry, Pierre Letouzey, Georges Gonthier:
Coq. The Seventeen Provers of the World 2006: 28-35 - [i2]Laurent Théry:
Formalising Sylow's theorems in Coq. CoRR abs/cs/0611057 (2006) - 2005
- [c12]Yves Bertot, Laurent Théry:
Dependent Types, Theorem Proving, and Applications for a Verifying Compiler. VSTTE 2005: 173-181 - 2003
- [c11]Laurent Théry:
Proving Pearl: Knuth's Algorithm for Prime Numbers. TPHOLs 2003: 304-318 - [c10]Laurent Théry:
Colouring Proofs: A Lightweight Approach to Adding Formal Structure to Proofs. UITP@TPHOLs 2003: 121-138 - 2001
- [j4]Laurent Théry:
A Machine-Checked Implementation of Buchberger's Algorithm. J. Autom. Reason. 26(2): 107-137 (2001) - [c9]Marc Daumas, Laurence Rideau, Laurent Théry:
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing. TPHOLs 2001: 169-184 - [i1]Sylvie Boldo, Marc Daumas, Claire Moreau-Finot, Laurent Théry:
Computer validated proofs of a toolset for adaptable arithmetic. CoRR cs.MS/0107025 (2001) - 2000
- [c8]Pierre Letouzey, Laurent Théry:
Formalizing Stålmarck's Algorithm in Coq. TPHOLs 2000: 388-405
1990 – 1999
- 1999
- [e1]Yves Bertot, Gilles Dowek, André Hirschowitz, Christine Paulin-Mohring, Laurent Théry:
Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs'99, Nice, France, September, 1999, Proceedings. Lecture Notes in Computer Science 1690, Springer 1999, ISBN 3-540-66463-7 [contents] - 1998
- [j3]John Harrison, Laurent Théry:
A Skeptic's Approach to Combining HOL and Maple. J. Autom. Reason. 21(3): 279-294 (1998) - [j2]Yves Bertot, Laurent Théry:
A Generic Approach to Building User Interfaces for Theorem Provers. J. Symb. Comput. 25(2): 161-194 (1998) - [c7]Laurent Théry:
A Certified Version of Buchberger's Algorithm. CADE 1998: 349-364 - 1997
- [j1]Amy P. Felty, Laurent Théry:
Interactive Theorem Proving with Temporal Logic. J. Symb. Comput. 23(4): 367-397 (1997) - 1995
- [c6]Yann Coscoy, Gilles Kahn, Laurent Théry:
Extracting Text from Proofs. TLCA 1995: 109-123 - 1994
- [c5]Yves Bertot, Gilles Kahn, Laurent Théry:
Proof by Pointing. TACS 1994: 141-160 - 1993
- [c4]John Harrison, Laurent Théry:
Reasoning About the Reals: The Marriage of HOL and Maple. LPAR 1993: 351-353 - [c3]Laurent Théry:
A Proof Development System for HOL. HUG 1993: 115-128 - [c2]John Harrison, Laurent Théry:
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals. HUG 1993: 174-184 - 1992
- [c1]Laurent Théry, Yves Bertot, Gilles Kahn:
Real theorem provers deserve real user-interfaces. SDE 1992: 120-129
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-10-07 21:25 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:
