University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Formally Verifed Numerical Methods

Formally Verifed Numerical Methods

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

VS2W01 - Vistas in Verified Software

To formally and foundationally verify correctness and accuracy of numerical software, we take a layered, end-to-end approach: prove that the C program correctly implements a floating-point functional model, prove that this float model accurately approximates a real-valued discretized functional model; prove that the real-valued functional model finds sufficiently accurate solutions to the mathematical problem. (Discretized means, e.g., finite time-steps or a finite spatial mesh.) We compose all these proofs into a single main theorem in Coq, stating an overall quantitative accuracy bound for the final result. We demonstrate the method on an ordinary differential equation initial value problem (ODE IVP ).  Co-authors: names and affiliations: Ariel E. Kellison (Cornell)  

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity