( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A relational logic for higher-order programs.

, , , , и . Proc. ACM Program. Lang., 1 (ICFP): 21:1-21:29 (2017)

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.

Pierre-Yves Vandenbussche

Pierre-Yves Chevalier

Pierre-Yves Laffont

Pierre-Yves Lucas

Yves Pierre Clocuh

 

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

EasyPQC: Verifying Post-Quantum Cryptography., , , , , , , , и . CCS, стр. 2564-2586. ACM, (2021)Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials., , , и . CPP, стр. 76-87. ACM, (2016)The Last Mile: High-Assurance and High-Speed Cryptographic Implementations., , , , , , , и . SP, стр. 965-982. IEEE, (2020)hacspec: Towards Verifiable Crypto Standards., , и . SSR, том 11322 из Lecture Notes in Computer Science, стр. 1-20. Springer, (2018)Coq without Type Casts: A Complete Proof of Coq Modulo Theory., и . LPAR, том 46 из EPiC Series in Computing, стр. 474-489. EasyChair, (2017)Jasmin: High-Assurance and High-Speed Cryptography., , , , , , , , , и . CCS, стр. 1807-1823. ACM, (2017)Machine-Checked Proofs for Cryptographic Standards., , , , , , , , , и . IACR Cryptol. ePrint Arch., (2019)Building Decision Procedures in the Calculus of Inductive Constructions., , и . CSL, том 4646 из Lecture Notes in Computer Science, стр. 328-342. Springer, (2007)Modular code-based cryptographic verification., , и . CCS, стр. 341-350. ACM, (2011)Type Theory and Decision Procedures. (Théorie des Types et Procédures de Décision).. École Polytechnique, Palaiseau, France, (2008)