<cite id="xvznh"><span id="xvznh"><var id="xvznh"></var></span></cite>
<span id="xvznh"><video id="xvznh"></video></span><strike id="xvznh"><dl id="xvznh"></dl></strike>
<th id="xvznh"><noframes id="xvznh"><span id="xvznh"></span>
<strike id="xvznh"></strike><span id="xvznh"></span>
<ruby id="xvznh"></ruby>
<strike id="xvznh"></strike>
<strike id="xvznh"><dl id="xvznh"></dl></strike><strike id="xvznh"><i id="xvznh"></i></strike>
<span id="xvznh"></span>
11月14日: Jean-Jacques Levy
發布時間:2019-11-12  閱讀次數:8332

報告題目: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


報告摘要: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.pusatkosmetika.com Copyright Software Engineering Institute
院長信箱:yuanzhang@sei.ecnu.edu.cn | 院辦電話:021-62232550 | 學院地址:上海中山北路3663號理科大樓