( en | de | ru )

 

Disambiguation of "Strub, Pierre-Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Unsolvability of the Quintic Formalized in Dependent Type Theory.

, , , and . ITP, volume 193 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Pierre-Yves Vandenbussche

Pierre-Yves Chevalier

Pierre-Yves Laffont

Pierre-Yves Lucas

Yves Pierre Clocuh

 

Other publications of authors with the same name

Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials., , , and . CPP, page 76-87. ACM, (2016)EasyPQC: Verifying Post-Quantum Cryptography., , , , , , , , and . CCS, page 2564-2586. ACM, (2021)The Last Mile: High-Assurance and High-Speed Cryptographic Implementations., , , , , , , and . SP, page 965-982. IEEE, (2020)A relational logic for higher-order programs., , , , and . J. Funct. Program., (2019)hacspec: Towards Verifiable Crypto Standards., , and . SSR, volume 11322 of Lecture Notes in Computer Science, page 1-20. Springer, (2018)Machine-Checked Proofs for Cryptographic Standards., , , , , , , , , and . IACR Cryptol. ePrint Arch., (2019)Building Decision Procedures in the Calculus of Inductive Constructions., , and . CSL, volume 4646 of Lecture Notes in Computer Science, page 328-342. Springer, (2007)Modular code-based cryptographic verification., , and . CCS, page 341-350. ACM, (2011)Jasmin: High-Assurance and High-Speed Cryptography., , , , , , , , , and . CCS, page 1807-1823. ACM, (2017)Coq without Type Casts: A Complete Proof of Coq Modulo Theory., and . LPAR, volume 46 of EPiC Series in Computing, page 474-489. EasyChair, (2017)