Approximate Relational Hoare Logic for Continuous Random Samplings

Abstract

Approximate relational Hoare logic (apRHL) is a logic for formal verification of the differential privacy of databases written in the programming language pWHILE. Strictly speaking, however, this logic deals only with discrete random samplings. In this paper, we define the graded relational lifting of the subprobabilistic variant of Giry monad, which described differential privacy. We extend the logic apRHL with this graded lifting to deal with continuous random samplings. We give a generic method to give proof rules of apRHL for continuous random samplings.

Cited by in corpus (11)

• Proving Expected Sensitivity of Probabilistic Programs
• Coupling proofs are probabilistic product programs
• Hypothesis Testing Interpretations and Renyi Differential Privacy
• Approximate Span Liftings
• Differentially Private Bayesian Programming
• Approximate Relational Reasoning for Higher-Order Probabilistic Programs
• Duet: An Expressive Higher-order Language and Linear Type System for Statically Enforcing Differential Privacy
• Probabilistic Relational Reasoning via Metrics
• Fuzzi: A Three-Level Logic for Differential Privacy
• Divergences on Monads for Relational Program Logics
• Higher-order probabilistic adversarial computations: Categorical semantics and program logics