4 papers
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program
Sylvie Boldo, François Clément, Jean-Christophe Filliâtre +3
Computer programs may go wrong due to exceptional behaviors, out-of-bound array accesses, or simply coding errors. Thus, they cannot be blindly trusted. Scientific computing progra…
Formal Proof of a Wave Equation Resolution Scheme: the Method Error
Sylvie Boldo, François Clément, Jean-Christophe Filliâtre +3
Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive formalizati…
Formal Proof of a Wave Equation Resolution Scheme: the Method Error
Sylvie Boldo, François Clément, Jean-Christophe Filliâtre +3
Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive formalizati…
On the implementation of construction functions for non-free concrete data types
Frédéric Blanqui, Thérèse Hardin, Pierre Weis
Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes o…