Sudeep Kanav’s research while affiliated with Technical University of Munich and other places

... Then one devises more optimised versions of the algorithm, and only proves the optimizations correct in this latter step, thus separating mathematical reasoning from implementation specific reasoning. This approach was used in most successful algorithm verification efforts (Klein et al. 2009;Esparza et al. 2013;Kanav, Lammich, and Popescu 2014). In this work, the three most important stages are the initial abstract algorithm, an implementation with abstract data structures, and finally an implementation with concretized data structures. ...

Reference:

Formally Verified Approximate Policy Iteration