( en | de | ru )

 

Disambiguation

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.

Laurent Bartholdi

Laurent Ntahuga

Thomas Laurent

Thomas Laurent

Laurent Herschke

 

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

A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers., и . IJCAR, том 4130 из Lecture Notes in Computer Science, стр. 423-437. Springer, (2006)Proof Pearl: Revisiting the Mini-rubik in Coq.. TPHOLs, том 5170 из Lecture Notes in Computer Science, стр. 310-319. Springer, (2008)Primality Proving with Elliptic Curves., и . TPHOLs, том 4732 из Lecture Notes in Computer Science, стр. 319-333. Springer, (2007)A Proof Development System for HOL.. HUG, том 780 из Lecture Notes in Computer Science, стр. 115-128. Springer, (1993)A Certified Version of Buchberger's Algorithm.. CADE, том 1421 из Lecture Notes in Computer Science, стр. 349-364. Springer, (1998)Reasoning About the Reals: The Marriage of HOL and Maple., и . LPAR, том 698 из Lecture Notes in Computer Science, стр. 351-353. Springer, (1993)Distant decimals of $π$., , и . CoRR, (2017)Computable analysis and notions of continuity in Coq., , и . Log. Methods Comput. Sci., (2021)Extracting Text from Proofs., , и . TLCA, том 902 из Lecture Notes in Computer Science, стр. 109-123. Springer, (1995)A Flexible Proof Format for SMT: a Proposal., , и . PxTP, стр. 15-26. (2011)