default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Faissole
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Florian Faissole
:
Formally-Verified Round-Off Error Analysis of Runge-Kutta Methods. J. Autom. Reason. 68(1): 1 (2024)- [c8]Florian Faissole, Paul Geneau de Lamarlière, Guillaume Melquiond:
End-To-End Formal Verification of a Fast and Accurate Floating-Point Approximation. ITP 2024: 14:1-14:18 - 2023
- [c7]Paul Geneau de Lamarlière, Guillaume Melquiond, Florian Faissole:
Slimmer Formal Proofs for Mathematical Libraries. ARITH 2023: 32-35 - 2022
- [j4]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. J. Autom. Reason. 66(2): 175-213 (2022) - [j3]Cláudio Belo Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, Hiroaki Inoue:
Automated formal analysis of temporal properties of Ladder programs. Int. J. Softw. Tools Technol. Transf. 24(6): 977-997 (2022) - 2021
- [j2]Martin E. Bidlingmaier, Florian Faissole, Bas Spitters:
Synthetic topology in Homotopy Type Theory for probabilistic programming. Math. Struct. Comput. Sci. 31(10): 1301-1329 (2021) - [c6]Cláudio Belo Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, Hiroaki Inoue:
Automated Verification of Temporal Properties of Ladder Programs. FMICS 2021: 21-38 - [i2]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. CoRR abs/2104.05256 (2021) - 2020
- [j1]Sylvie Boldo, Florian Faissole, Alexandre Chapoutot:
Round-Off Error and Exceptional Behavior Analysis of Explicit Runge-Kutta Methods. IEEE Trans. Computers 69(12): 1745-1756 (2020)
2010 – 2019
- 2019
- [b1]Florian Faissole:
Formalisations d'analyses d'erreurs en analyse numérique et en arithmétique à virgule flottante. (Formalizations of error analysis in numerical analysis and floating-point arithmetic). University of Paris-Saclay, France, 2019 - [c5]Florian Faissole, George A. Constantinides, David B. Thomas:
Formalizing Loop-Carried Dependencies in Coq for High-Level Synthesis. FCCM 2019: 315 - [i1]Martin E. Bidlingmaier, Florian Faissole, Bas Spitters:
Synthetic topology in Homotopy Type Theory for probabilistic programming. CoRR abs/1912.07339 (2019) - 2018
- [c4]Sylvie Boldo, Florian Faissole, Vincent Tourneur:
A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers. ARITH 2018: 69-75 - 2017
- [c3]Sylvie Boldo, Florian Faissole, Alexandre Chapoutot:
Round-off Error Analysis of Explicit One-Step Numerical Integration Methods. ARITH 2017: 82-89 - [c2]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq formal proof of the LaxMilgram theorem. CPP 2017: 79-89 - [c1]Florian Faissole:
Formalization and Closedness of Finite Dimensional Subspaces. SYNASC 2017: 121-128
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-09-04 01:21 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:
