70 citations · 96 across the 8 of their papers we have counts for
8 papers
A strong call-by-need calculus
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
We present a call-by-need -calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed…
Plotting in a Formally Verified Way
Guillaume Melquiond
An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions,…
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…
Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program
Sylvie Boldo, Francois Clement, Jean-Christophe Filliâtre +3
We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors…
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…