|
佐藤哲也 研究業績一覧 (25件)
- 2005
- 2004
- 2003
- 2002
- 2001
- 全件表示
論文
-
Yusuke Kawamoto,
Tetsuya Sato,
Kohei Suenaga.
Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs,
Artificial Intelligence,
Jan. 2024.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
国際会議発表 (査読有り)
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
-
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.
公式リンク
国内会議発表 (査読有り)
国際会議発表 (査読なし・不明)
国内会議発表 (査読なし・不明)
[ BibTeX 形式で保存 ]
[ 論文・著書をCSV形式で保存
]
[ 特許をCSV形式で保存
]
|