Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle
classification
💻 cs.LO
keywords
algorithmformalisabelleproofwhy3alwaysassistantscarried
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.