Hypothesis testing interpretations and renyi differential privacy B Balle, G Barthe, M Gaboardi, J Hsu, T Sato
International Conference on Artificial Intelligence and Statistics, 2496-2506, 2020
58 2020 Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, bayesian inference, and optimization T Sato, A Aguirre, G Barthe, M Gaboardi, D Garg, J Hsu
Proceedings of the ACM on Programming Languages 3 (POPL), 1-30, 2019
31 2019 Approximate relational Hoare logic for continuous random samplings T Sato
Electronic Notes in Theoretical Computer Science 325, 277-298, 2016
27 2016 Preorders on monads and coalgebraic simulations S Katsumata, T Sato
Foundations of Software Science and Computation Structures: 16th …, 2013
22 2013 Approximate span liftings: Compositional semantics for relaxations of differential privacy T Sato, G Barthe, M Gaboardi, J Hsu, S Katsumata
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2019
21 2019 Codensity liftings of monads S Katsumata, T Sato
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015
21 2015 Codensity lifting of monads and its dual S Katsumata, T Sato, T Uustalu
arXiv preprint arXiv:1810.07972, 2018
16 2018 The Giry monad is not strong for the canonical symmetric monoidal closed structure on Meas T Sato
Journal of Pure and Applied Algebra 222 (10), 2888-2896, 2018
11 2018 Higher-order probabilistic adversarial computations: categorical semantics and program logics A Aguirre, G Barthe, M Gaboardi, D Garg, S Katsumata, T Sato
Proceedings of the ACM on Programming Languages 5 (ICFP), 1-30, 2021
9 2021 ⋆-Liftings for differential privacy G Barthe, T Espitau, J Hsu, T Sato, PY Strub
9 2017 Graded Hoare logic and its categorical semantics M Gaboardi, S Katsumata, D Orchard, T Sato
Programming Languages and Systems: 30th European Symposium on Programming …, 2021
8 2021 Relational G Barthe, T Espitau, J Hsu, T Sato, PY Strub
Logical Methods in Computer Science 15, 2019
8 2019 Identifying all preorders on the subdistribution monad T Sato
Electronic Notes in Theoretical Computer Science 308, 309-327, 2014
3 2014 Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic Y Kawamoto, T Sato, K Suenaga
Proceedings of the International Conference on Principles of Knowledge …, 2021
2 2021 A probabilistic monad with nondeterminism for coalgebraic trace semantics T Sato
CALCO Young Researchers Workshop CALCO-jnr 2011, 12, 2011
2 2011 Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL M Hirata, Y Minamide, T Sato
Functional and Logic Programming: 16th International Symposium, FLOPS 2022 …, 2022
1 2022 A nondeterministic probabilistic monad for deterministic schedulers on probabilistic automata T Sato
Master’s thesis, Research Institute for Mathematical Sciences, Kyoto University, 2011
1 2011 Quasi-Borel Spaces. M Hirata, Y Minamide, T Sato
Arch. Formal Proofs 2022, 2022
2022 Sound and Relatively Complete Belief Hoare Logic for Statistical Hypothesis Testing Programs Y Kawamoto, T Sato, K Suenaga
arXiv preprint arXiv:2208.07074, 2022
2022 Divergences on Monads for Relational Program Logics T Sato, S Katsumata
arXiv preprint arXiv:2206.05716, 2022
2022 
Marco GaboardiBoston UniversityAdresse e-mail validée de bu.edu
