Följ
Tetsuya Sato
Titel
Citeras av
Citeras av
År
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
912020
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
352019
Approximate relational Hoare logic for continuous random samplings
T Sato
Electronic Notes in Theoretical Computer Science 325, 277-298, 2016
282016
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
222019
Preorders on monads and coalgebraic simulations
S Katsumata, T Sato
Foundations of Software Science and Computation Structures: 16th …, 2013
212013
Codensity liftings of monads
S Katsumata, T Sato
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015
202015
Codensity lifting of monads and its dual
S Katsumata, T Sato, T Uustalu
Logical Methods in Computer Science 14, 2018
172018
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
112018
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
102021
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
102021
⋆-Liftings for differential privacy
G Barthe, T Espitau, J Hsu, T Sato, PY Strub
92017
Relational -Liftings for Differential Privacy
G Barthe, T Espitau, J Hsu, T Sato, PY Strub
Logical Methods in Computer Science 15, 2019
52019
Program logic for higher-order probabilistic programs in Isabelle/HOL
M Hirata, Y Minamide, T Sato
Science of Computer Programming 230, 102993, 2023
42023
Identifying all preorders on the subdistribution monad
T Sato
Electronic Notes in Theoretical Computer Science 308, 309-327, 2014
32014
Semantic foundations of higher-order probabilistic programs in Isabelle/HOL
M Hirata, Y Minamide, T Sato
14th International Conference on Interactive Theorem Proving (ITP 2023), 2023
22023
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
22021
A probabilistic monad with nondeterminism for coalgebraic trace semantics
T Sato
CALCO Young Researchers Workshop CALCO-jnr 2011, 12, 2011
22011
Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs
Y Kawamoto, T Sato, K Suenaga
Artificial Intelligence 326, 104045, 2024
12024
Formalizing statistical causality via modal logic
Y Kawamoto, T Sato, K Suenaga
European Conference on Logics in Artificial Intelligence, 681-696, 2023
12023
A nondeterministic probabilistic monad for deterministic schedulers on probabilistic automata
T Sato
Master’s thesis, Research Institute for Mathematical Sciences, Kyoto University, 2011
12011
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20