default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuya Sato 0001
Person information
- affiliation: Tokyo Institute of Technology, Japan
Other persons with the same name
- Tetsuya Sato — disambiguation page
- Tetsuya Sato 0002 — Waseda University, Tokyo, Japan
- Tetsuya Sato 0003 — Kyushu University, Fukuoka, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c13]Tetsuya Sato
, Yasuhiko Minamide:
Formalization of Differential Privacy in Isabelle/HOL. CPP 2025: 67-82- 2024
- [j8]Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs. Artif. Intell. 326: 104045 (2024) - 2023
- [j7]Tetsuya Sato, Shin-ya Katsumata:
Divergences on monads for relational program logics. Math. Struct. Comput. Sci. 33(4-5): 427-485 (2023) - [j6]Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato:
Program logic for higher-order probabilistic programs in Isabelle/HOL. Sci. Comput. Program. 230: 102993 (2023) - [c12]Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato:
Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL. ITP 2023: 18:1-18:18 - [c11]Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Formalizing Statistical Causality via Modal Logic. JELIA 2023: 681-696 - 2022
- [j5]Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato:
Quasi-Borel Spaces. Arch. Formal Proofs 2022 (2022) - [c10]Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato:
Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL. FLOPS 2022: 57-74 - [i11]Tetsuya Sato, Shin-ya Katsumata:
Divergences on Monads for Relational Program Logics. CoRR abs/2206.05716 (2022) - [i10]Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Sound and Relatively Complete Belief Hoare Logic for Statistical Hypothesis Testing Programs. CoRR abs/2208.07074 (2022) - [i9]Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Formalizing Statistical Causality via Modal Logic. CoRR abs/2210.16751 (2022) - 2021
- [j4]Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato:
Higher-order probabilistic adversarial computations: categorical semantics and program logics. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - [c9]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. ESOP 2021: 234-263 - [c8]Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic. KR 2021: 411-421 - [i8]Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato:
Higher-order probabilistic adversarial computations: Categorical semantics and program logics. CoRR abs/2107.01155 (2021) - 2020
- [c7]Borja Balle, Gilles Barthe, Marco Gaboardi, Justin Hsu, Tetsuya Sato:
Hypothesis Testing Interpretations and Renyi Differential Privacy. AISTATS 2020: 2496-2506 - [i7]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. CoRR abs/2007.11235 (2020)
2010 – 2019
- 2019
- [j3]Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
Relational ⋆⋆\star-Liftings for Differential Privacy. Log. Methods Comput. Sci. 15(4) (2019) - [j2]Tetsuya Sato, Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Justin Hsu:
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization. Proc. ACM Program. Lang. 3(POPL): 38:1-38:30 (2019) - [c6]Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy. LICS 2019: 1-14 - [i6]Borja Balle, Gilles Barthe, Marco Gaboardi, Justin Hsu, Tetsuya Sato:
Hypothesis Testing Interpretations and Renyi Differential Privacy. CoRR abs/1905.09982 (2019) - 2018
- [j1]Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu:
Codensity Lifting of Monads and its Dual. Log. Methods Comput. Sci. 14(4) (2018) - [i5]Tetsuya Sato, Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Justin Hsu:
Formal verification of higher-order probabilistic programs. CoRR abs/1807.06091 (2018) - [i4]Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu:
Codensity Lifting of Monads and its Dual. CoRR abs/1810.07972 (2018) - 2017
- [c5]Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
*-Liftings for Differential Privacy. ICALP 2017: 102:1-102:12 - [i3]Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
*-Liftings for Differential Privacy. CoRR abs/1705.00133 (2017) - [i2]Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Reasoning about Divergences for Relaxations of Differential Privacy. CoRR abs/1710.09010 (2017) - 2016
- [c4]Tetsuya Sato:
Approximate Relational Hoare Logic for Continuous Random Samplings. MFPS 2016: 277-298 - [i1]Tetsuya Sato:
Approximate Relational Hoare Logic for Continuous Random Samplings. CoRR abs/1603.01445 (2016) - 2015
- [c3]Shin-ya Katsumata, Tetsuya Sato:
Codensity Liftings of Monads. CALCO 2015: 156-170 - 2014
- [c2]Tetsuya Sato:
Identifying All Preorders on the Subdistribution Monad. MFPS 2014: 309-327 - 2013
- [c1]Shin-ya Katsumata, Tetsuya Sato:
Preorders on Monads and Coalgebraic Simulations. FoSSaCS 2013: 145-160
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
