activity
20162024
most citedFormal verification of higher-order probabilistic programs

28 citations · 123 across the 13 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2024

Formalization of Differential Privacy in Isabelle/HOL

Tetsuya Sato, Yasuhiko Minamide

Differential privacy is a statistical definition of privacy that has attracted the interest of both academia and industry. Its formulations are easy to understand, but the differen…

cs.LO2021

Higher-order probabilistic adversarial computations: Categorical semantics and program logics

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +3

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with pri…

cs.LO2020

Graded Hoare Logic and its Categorical Semantics

Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard +1

Deductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend o…

cs.LO2018★ 1 cited

Codensity Lifting of Monads and its Dual

Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu

We introduce a method to lift monads on the base category of a fibration to its total category. This method, which we call codensity lifting, is applicable to various fibrations wh…

cs.LO2018★ 28 cited

Formal verification of higher-order probabilistic programs

Tetsuya Sato, Alejandro Aguirre, Gilles Barthe +3

Probabilistic programming provides a convenient lingua franca for writing succinct and rigorous descriptions of probabilistic models and inference tasks. Several probabilistic prog…

cs.LO2017

Relational -Liftings for Differential Privacy

Gilles Barthe, Thomas Espitau, Justin Hsu +2

Recent developments in formal verification have identified approximate liftings (also known as approximate couplings) as a clean, compositional abstraction for proving differential…

cs.LO2016★ 26 cited

Approximate Relational Hoare Logic for Continuous Random Samplings

Tetsuya Sato

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…