( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability.

, , , , и . CCS, стр. 2541-2563. ACM, (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.

Caroline Barthe

Mathis Barthe

Christoph Barthe

Gerhard Barthe

Annelie Barthe

 

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

Formal verification of a constant-time preserving C compiler., , , , , , и . Proc. ACM Program. Lang., 4 (POPL): 7:1-7:30 (2020)Safe couplings: coupled refinement types., , и . Proc. ACM Program. Lang., 6 (ICFP): 596-624 (2022)Product programs and relational program logics., , и . J. Log. Algebraic Methods Program., 85 (5): 847-859 (2016)Universal Equivalence and Majority of Probabilistic Programs over Finite Fields., , и . ACM Trans. Comput. Log., 23 (1): 5:1-5:42 (2022)Partial Evaluation and Non-interference for Object Calculi., и . Fuji International Symposium on Functional and Logic Programming, том 1722 из Lecture Notes in Computer Science, стр. 53-67. Springer, (1999)Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant., , , и . FLOPS, том 3945 из Lecture Notes in Computer Science, стр. 114-129. Springer, (2006)Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs., , и . MPC, том 7342 из Lecture Notes in Computer Science, стр. 1-6. Springer, (2012)SoK: Practical Foundations for Spectre Defenses., , , , и . CoRR, (2021)Formally verifying Kyber Part I: Implementation Correctness., , , , , , , , , и 2 other автор(ы). IACR Cryptol. ePrint Arch., (2023)Coupling proofs are probabilistic product programs., , , и . POPL, стр. 161-174. ACM, (2017)