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

International Conference on Interactive Theorem Proving Pub Date : 2019-09-08 DOI:10.4230/LIPIcs.ITP.2019.13

Ran Chen, C. Cohen, J. Lévy, Stephan Merz, L. Théry

引用次数: 8

Abstract

Comparing 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.

查看原文本刊更多论文

Tarjan强连通分量算法在Why3, Coq和Isabelle中的形式化证明

比较同一问题形式化的证明者总是一项有价值的工作。在本文中，我们从图论中提出了一个非平凡算法的正确性的形式化证明，该证明是在三个证明助手:Why3,Coq和Isabelle中进行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Conference on Interactive Theorem Proving

自引率

0.00%

发文量