Author of the publication

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

, , , , and . ITP, volume 141 of LIPIcs, page 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Synchronization modulo P in dynamic networks., , and . Theor. Comput. Sci., (2023)Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series), and . Springer Publishing Company, Incorporated, (2008)Selected Extended Papers of ITP 2016: Preface., and . J. Autom. Reason., 62 (2): 169-170 (2019)Refining Mobile UML State Machines, , and . (2004)Towards an Automatic Proof of the Bakery Algorithm., , and . FORTE, volume 13910 of Lecture Notes in Computer Science, page 21-28. Springer, (2023)Preface., and . AVoCS, volume 185 of Electronic Notes in Theoretical Computer Science, page 1-2. Elsevier, (2006)Proofs and Proof Certification in the TLA+ Proof System.. PxTP, volume 878 of CEUR Workshop Proceedings, page 16-20. CEUR-WS.org, (2012)Extending PlusCal for Modeling Distributed Algorithms., and . iFM, volume 14300 of Lecture Notes in Computer Science, page 321-340. Springer, (2023)Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks., , , and . ECEASST, (2018)The TLA<sup> + </sup> Proof System: Building a Heterogeneous Verification Platform, , , and . Theoretical Aspects of Computing – ICTAC 2010, volume 6255 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 10.1007/978-3-642-14808-8_3.(2010)