报告题目：Three formal proofs of Tarjan’s Strongly Connected Components algorithm in directed graphs

报告人：Prof. Jean-Jacques Levy (Inria Paris & Irif)

报告时间：2019年11月14日 周四 09:30 – 10:30

报告地点：理科大楼B1002

报告摘要：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.

Joint work with Ran Chen, Cyril Cohen, Stephan Merz and Laurent Théry presented at ITP 2019.