From post

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

, , , , и . ITP, том 141 из LIPIcs, стр. 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Proofs and Proof Certification in the TLA+ Proof System.. PxTP, том 878 из CEUR Workshop Proceedings, стр. 16-20. CEUR-WS.org, (2012)Extending PlusCal for Modeling Distributed Algorithms., и . iFM, том 14300 из Lecture Notes in Computer Science, стр. 321-340. Springer, (2023)Towards an Automatic Proof of the Bakery Algorithm., , и . FORTE, том 13910 из Lecture Notes in Computer Science, стр. 21-28. Springer, (2023)Refining Mobile UML State Machines, , и . (2004)Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series), и . Springer Publishing Company, Incorporated, (2008)Synchronization Modulo k in Dynamic Networks., , и . SSS, том 13046 из Lecture Notes in Computer Science, стр. 425-439. Springer, (2021)Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS., , и . ISoLA (1), том 13701 из Lecture Notes in Computer Science, стр. 88-105. Springer, (2022)Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams., , и . GI Jahrestagung (1), том 157 из Schriftenreihe der Österreichischen Computer-Gesellschaft, стр. 628-634. Konstanz UVK-Verl.-Ges., (2001)Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle., , , , и . ITP, том 141 из LIPIcs, стр. 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Proving the Correctness of Disk Paxos in Isabelle/HOL, и . http://afp.sourceforge.net/entries/DiskPaxos.shtml, (июня 2005)