11月14日: Jean-Jacques Levy
发布时间:2019-11-12  阅读次数:1554

报告题目: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.

华东师范大学软件工程学院
www.sei.ecnu.edu.cn Copyright Software Engineering Institute
院长信箱:yuanzhang@sei.ecnu.edu.cn | 院办电话:021-62232550 | 学院地址:上海中山北路3663号理科大楼