Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle

International audienceComparing provers on a formalization of the same problem is always a valuable exercise. In thispaper, we present the formal proof of correctness of a non-trivial algorithm from graph theory thatwas carried out in three proof assistants: Why3,Coq, and Isabelle