Florian Faissole

Orcid: 0000-0001-5792-0658

According to our database1, Florian Faissole authored at least 14 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Formally-Verified Round-Off Error Analysis of Runge-Kutta Methods.
J. Autom. Reason., March, 2024

End-To-End Formal Verification of a Fast and Accurate Floating-Point Approximation.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

2023
Slimmer Formal Proofs for Mathematical Libraries.
Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

2022
Automated formal analysis of temporal properties of Ladder programs.
Int. J. Softw. Tools Technol. Transf., 2022

A Coq Formalization of Lebesgue Integration of Nonnegative Functions.
J. Autom. Reason., 2022

2021
Synthetic topology in Homotopy Type Theory for probabilistic programming.
Math. Struct. Comput. Sci., 2021

Automated Verification of Temporal Properties of Ladder Programs.
Proceedings of the Formal Methods for Industrial Critical Systems, 2021

2020
Round-Off Error and Exceptional Behavior Analysis of Explicit Runge-Kutta Methods.
IEEE Trans. Computers, 2020

2019
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).
PhD thesis, 2019

Formalizing Loop-Carried Dependencies in Coq for High-Level Synthesis.
Proceedings of the 27th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2019

2018
A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers.
Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

2017
Formalization and Closedness of Finite Dimensional Subspaces.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

A Coq formal proof of the LaxMilgram theorem.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

Round-off Error Analysis of Explicit One-Step Numerical Integration Methods.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017


  Loading...