|
Publication List - Tetsuya Sato (25 entries)
- 1997
- 1996
- 1995
- 1994
- 1993
- All
Journal Paper
-
Yusuke Kawamoto,
Tetsuya Sato,
Kohei Suenaga.
Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs,
Artificial Intelligence,
Jan. 2024.
Official location
-
Michikazu Hirata,
Yasuhiko Minamide,
Tetsuya Sato.
Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL,
14th Conference on Interactive Theorem Proving(ITP2023),
July 2023.
Official location
-
Michikazu Hirata,
Yasuhiko Minamide,
Tetsuya Sato.
Program logic for higher-order probabilistic programs in Isabelle/HOL,
Science of Computer Programming,
Vol. 230,
June 2023.
-
Tetsuya Sato,
Shin-ya Katsumata.
Divergences on monads for relational program logics,
Mathematical Structures in Computer Science,
Apr. 2023.
Official location
-
Michikazu Hirata,
Yasuhiko Minamide,
Tetsuya Sato.
Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL,
16th International Symposium on Functional and Logic Programming(FLOPS 2022),
Lecture notes in computer science, LNCS,
volume 13215,
May 2022.
Official location
-
Alejandro Aguirre,
Gilles Barthe,
Marco Gaboardi,
Deepak Garg,
Shin-ya Katsumata,
Tetsuya Sato.
Higher-order probabilistic adversarial computations: categorical semantics and program logics,
Proceedings of the ACM on Programming Languages,
Vol. 5,
No. ICFP,
pp. 1-30,
Aug. 2021.
Official location
-
Gilles Barthe,
Thomas Espitau,
Justin Hsu,
Tetsuya Sato,
Pierre-Yves Strub.
Relational *-Liftings for Differential Privacy.,
Logical Methods in Computer Science,
Volume 15,
Issue 154,
Dec. 2019.
Official location
-
Shin-ya Katsumata,
Tetsuya Sato,
Tarmo Uustalu.
Codensity Lifting of Monads and its Dual,
Logical Methods in Computer Science,
Volume 14,
Issue 4,
Oct. 2018.
Official location
-
Tetsuya Sato.
The Giry monad is not strong for the canonical symmetric monoidal closed structure on Meas,
Journal of Pure and Applied Algebra,
Vol. 222,
No. 10,
pp. 2888-2896,
Oct. 2018.
Official location
-
Tetsuya Sato.
Identifying all preorders on the subdistribution monad,
Mathematical Foundations of Programming Semantics Thirtieth Conference,
Electronic Notes in Theoretical Computer Science,
Elsevier B.V.,
Volume 308,
Page 309-327,
Oct. 2014.
Official location
International Conference (Reviewed)
-
Yusuke Kawamoto,
Tetsuya Sato,
Kohei Suenaga.
Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic,
18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022),
Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning,
Sept. 2021.
Official location
-
Marco Gaboardi,
Shin-ya Katsumata,
Dominic Orchard,
Tetsuya Sato.
Graded Hoare Logic and its Categorical Semantics,
30th European Symposium on Programming (ESOP 2021),
Lecture Notes in Computer Scienece (LNCS),
Springer International Publishing,
Volume 2648,
pp. 234-263,
Mar. 2021.
-
Tetsuya Sato,
Shin-ya Katsumata.
Divergences on Monads and Relational Liftings,
15th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS 2020),
Sept. 2020.
Official location
-
Tetsuya Sato,
Gilles Barthe,
Marco Gaboardi,
Justin Hsu,
Shin-ya Katsumata.
Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy,
34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
IEEE,
Aug. 2020.
Official location
-
Borja Balle,
Gilles Barthe,
Marco Gaboardi,
Justin Hsu,
Tetsuya Sato.
Hypothesis Testing Interpretations and Renyi Differential Privacy,
The 23rd International Conference on Artificial Intelligence and Statistics (AISTATS 2020),
Proceedings of Machine Learning Research,
volume 108,
2496-2506,
Aug. 2020.
Official location
-
Tetsuya Sato,
Alejandro Aguirre,
Gilles Barthe,
Marco Gaboardi,
Deepak Garg,
Justin Hsu.
Formal Verification of Higher-order Probabilistic Programs,
The 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019),
In Proceedings of the ACM on Programming Languages,
Volume 3,
Issue POPL,
Jan. 2019.
-
Gilles Barthe,
Thomas Espitau,
Justin Hsu,
Tetsuya Sato,
Pierre-Yves Strub.
∗-liftings for differential privacy,
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017),
Leibniz International Proceedings in Informatics, LIPIcs,
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
Vol. 80,
pp. 1-12,
July 2017.
Official location
-
Tetsuya Sato.
Approximate Relational Hoare Logic for Continuous Random Samplings,
Electronic Notes in Theoretical Computer Science,
Elsevier B.V.,
Volume 325,
Page 277-298,
Oct. 2016.
Official location
-
Shin-ya Katsumata,
Tetsuya Sato.
Codensity liftings of monads,
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015),
Leibniz International Proceedings in Informatics, LIPIcs,
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
Volume 35,
pp. 156-170,
Oct. 2015.
Official location
-
Shin-ya Katsumata,
Tetsuya Sato.
Preorders on monads and coalgebraic simulations,
International Conference on Foundations of Software Science and Computational Structures (FoSSaCS 2013),
Lecture notes in computer science, LNCS,
Springer-Verlag Berlin Heidelberg,
Volume 7794,
pp. 145-160,
Mar. 2013.
Official location
Domestic Conference (Reviewed)
International Conference (Not reviewed / Unknown)
Domestic Conference (Not reviewed / Unknown)
[ Save as BibTeX ]
[ Paper, Presentations, Books, Others, Degrees: Save as CSV
]
[ Patents: Save as CSV
]
|