Tetsuya Sato

According to our database, Tetsuya Sato authored at least 21 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs.

Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga

Artif. Intell., January, 2024

2023

Program logic for higher-order probabilistic programs in Isabelle/HOL.

Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato

Sci. Comput. Program., August, 2023

Divergences on monads for relational program logics.

Tetsuya Sato, Shin-ya Katsumata

Math. Struct. Comput. Sci., 2023

Formalizing Statistical Causality via Modal Logic.

Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL.

Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

2022

Quasi-Borel Spaces.

Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato

Arch. Formal Proofs, 2022

2021

Higher-order probabilistic adversarial computations: categorical semantics and program logics.

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato

Proc. ACM Program. Lang., 2021

Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic.

Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Graded Hoare Logic and its Categorical Semantics.

Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato

Proceedings of the Programming Languages and Systems, 2021

2020

Hypothesis Testing Interpretations and Renyi Differential Privacy.

Borja Balle, Gilles Barthe, Marco Gaboardi, Justin Hsu, Tetsuya Sato

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization.

Tetsuya Sato, Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Justin Hsu

Proc. ACM Program. Lang., 2019

Relational ⋆⋆\star-Liftings for Differential Privacy.

Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub

Log. Methods Comput. Sci., 2019

Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy.

Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Codensity Lifting of Monads and its Dual.

Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu

Log. Methods Comput. Sci., 2018

Formal verification of higher-order probabilistic programs.

Tetsuya Sato, Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Justin Hsu

CoRR, 2018

2017

Reasoning about Divergences for Relaxations of Differential Privacy.

Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata

CoRR, 2017

*-Liftings for Differential Privacy.

Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Approximate Relational Hoare Logic for Continuous Random Samplings.

Tetsuya Sato

Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

2015

Codensity Liftings of Monads.

Shin-ya Katsumata, Tetsuya Sato

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Identifying All Preorders on the Subdistribution Monad.

Tetsuya Sato

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013

Preorders on Monads and Coalgebraic Simulations.

Shin-ya Katsumata, Tetsuya Sato

Proceedings of the Foundations of Software Science and Computation Structures, 2013