Séminaire Marelle : Formal verification of exact computation using Newton’s method

On Wednesday 06/05/2009, at 11h, in room Fermat Jaune.

Speaker: Ioana Pasca.

Title: Formal verification of exact computation using Newton’s method.

We are interested in the certification of Newton’s method. We use a formalization of the convergence and stability of the method done with the axiomatic real numbers of Coq’s Standard Library in order to validate the computation with Newton’s method done with a library of exact real arithmetic based on co-inductive streams. The contribution of this work is twofold. Firstly, based on Newton’s method, we design and prove correct an algorithm on streams for computing the root of a real function in a lazy manner. Secondly, we prove that rounding at each step in Newton’s method still yields a convergent process with an accurate correlation between the precision of the input and that of the result. An algorithm including rounding turns out to be much more efficient.

URL: http://hal.inria.fr/inria-00369511/en/