| Publication | Date of Publication | Type |
|---|
| Approximate span liftings. Compositional semantics for relaxations of differential privacy | 2024-12-19 | Paper |
| Probabilistic relational reasoning via metrics | 2024-12-19 | Paper |
| Formalizing algorithmic bounds in the query model in EeasyCrypt | 2024-07-15 | Paper |
Differentially private confidence intervals for proportions under stratified random sampling
Electronic Journal of Statistics | 2024-05-29 | Paper |
| Stability is stable: connections between replicability, privacy, and adaptive generalization | 2024-05-08 | Paper |
| Bunched Fuzz: sensitivity for vector metrics | 2023-11-24 | Paper |
Relational cost analysis in a functional-imperative setting
Journal of Functional Programming | 2022-01-07 | Paper |
Coupled relational symbolic execution for differential privacy
(available as arXiv preprint) | 2021-10-18 | Paper |
Graded Hoare logic and its categorical semantics
(available as arXiv preprint) | 2021-10-18 | Paper |
| Categorical models for a semantically linear \(\lambda\)-calculus | 2021-02-09 | Paper |
An assertion-based program logic for probabilistic programs
(available as arXiv preprint) | 2019-09-13 | Paper |
Relational reasoning for Markov chains in a probabilistic guarded lambda calculus
(available as arXiv preprint) | 2019-09-13 | Paper |
| Privacy Amplification by Mixing and Diffusion Mechanisms | 2019-05-29 | Paper |
Proving differential privacy via probabilistic couplings
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6820309 (Why is no real title available?) | 2017-12-19 | Paper |
scientific article; zbMATH DE number 6820296 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
Relational cost analysis
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
A semantic account of metric preservation
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Algebras and coalgebras in the light affine lambda calculus
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Combining effects and coeffects via grading
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Computer-aided verification for mechanism design
Web and Internet Economics | 2017-02-10 | Paper |
Higher-order approximate relational refinement types for mechanism design and differential privacy
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
On the reification of semantic linearity
Mathematical Structures in Computer Science | 2016-07-28 | Paper |
An implicit characterization of PSPACE
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Realizability models for a linear dependent PCF
Theoretical Computer Science | 2015-05-26 | Paper |
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming | 2015-03-05 | Paper |
What is a model for a semantically linear -calculus?
Journal Of Logic And Computation | 2015-01-12 | Paper |
Linear dependent types for differential privacy
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
A logical account of pspace
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
A core quantitative coeffect calculus
Programming Languages and Systems | 2014-04-16 | Paper |
Soft linear logic and polynomial complexity classes
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
Linear dependent types and relative completeness
Logical Methods in Computer Science | 2013-01-07 | Paper |
Global and local space properties of stream programs
Foundational and Practical Aspects of Resource Analysis | 2010-09-14 | Paper |
A polytime functional language from light linear logic
Programming Languages and Systems | 2010-05-04 | Paper |
From light logics to type assignments: a case study
Logic Journal of the IGPL | 2009-11-12 | Paper |
Upper Bounds on Stream I/O Using Semantic Interpretations
Computer Science Logic | 2009-11-12 | Paper |
A By-Level Analysis of Multiplicative Exponential Linear Logic
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Type Inference for a Polynomial Lambda Calculus
Lecture Notes in Computer Science | 2009-07-02 | Paper |
A Soft Type Assignment System for λ-Calculus
Computer Science Logic | 2009-03-05 | Paper |
