Author:
Barthe Gilles,Köpf Boris,Olmedo Federico,Zanella Béguelin Santiago
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs;Proceedings of the ACM on Programming Languages;2024-01-05
2. Asynchronous Probabilistic Couplings in Higher-Order Separation Logic;Proceedings of the ACM on Programming Languages;2024-01-05
3. Group and Attack: Auditing Differential Privacy;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
4. Detecting Violations of Differential Privacy for Quantum Algorithms;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
5. Automated Sensitivity Analysis for Probabilistic Loops;iFM 2023;2023-11-06