Formal Proofs of Tarjan’s Strongly Connected Components Algorithm in Why3, Coq and Isabelle
Ran Chen, Cyril Cohen, Jean-Jacques Lévy, Stephan Merz, Laurent Théry · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2019
Comparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants: Why3, Coq, and Isabelle.