Being able to detect program runtime complexity is useful in many tasks (eg, checking
expected performance and identifying potential security vulnerabilities). In this work, we …

This dissertation is concerned with the question of formally verifying that the implementation
of an algorithm is not only functionally correct (it always returns the right result), but also has …

This dissertation is concerned with the question of formally verifying that the imple-mentation
of an algorithm is not only functionally correct (it always returns the right result), but also has …

In this thesis, we put a library for analysis in the Coq proof assistant to the test through a
case study in control theory. We formalise a proof of stability for the inverted pendulum, a …

Il s' agit de mettre à l'épreuve une bibliothèque d'analyse dans l'assistant de preuve Coq au
travers d'une étude de cas en théorie du contrôle. Nous formalisons une preuve de stabilité …

The LLL basis reduction algorithm was the first polynomial-time algorithm to compute a
reduced basis of a given lattice, and hence also a short vector in the lattice. It approximates …