default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShin-ya Katsumata
Person information
- unicode name: 勝股 審也
- affiliation: National Institute of Informatics, Tokyo, Japan
- affiliation: Kyoto University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Ichiro Hasuo
, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata:
Control-data separation and logical condition propagation for efficient inference on probabilistic programs. J. Log. Algebraic Methods Program. 136: 100922 (2024)- [c40]Mayuko Kori, Kazuki Watanabe, Jurriaan Rot, Shin-ya Katsumata:
Composing Codensity Bisimulations. LICS 2024: 52:1-52:13 - [i22]Mayuko Kori, Kazuki Watanabe, Jurriaan Rot, Shin-ya Katsumata:
Composing Codensity Bisimulations. CoRR abs/2404.08308 (2024) - 2023
- [j11]Tetsuya Sato, Shin-ya Katsumata:
Divergences on monads for relational program logics. Math. Struct. Comput. Sci. 33(4-5): 427-485 (2023) - [c39]Shin-ya Katsumata, Xavier Rival, Jérémy Dubut:
A Categorical Framework for Program Semantics and Semantic Abstraction. MFPS 2023 - 2022
- [j10]Koki Nishizawa, Shin-ya Katsumata, Yuichi Komorida:
Stone dualities from opfibrations. J. Log. Algebraic Methods Program. 127: 100773 (2022) - [j9]Alejandro Aguirre, Shin-ya Katsumata, Satoshi Kura:
Weakest preconditions in fibrations. Math. Struct. Comput. Sci. 32(4): 472-510 (2022) - [j8]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Samuel Humeau, Clovis Eberhart, Ichiro Hasuo:
Codensity Games for Bisimilarity. New Gener. Comput. 40(2): 403-465 (2022) - [j7]Shin-ya Katsumata, Dylan McDermott, Tarmo Uustalu, Nicolas Wu:
Flexible presentations of graded monads. Proc. ACM Program. Lang. 6(ICFP): 902-930 (2022) - [j6]Ohad Kammar, Shin-ya Katsumata, Philip Saville:
Fully abstract models for effectful λ-calculi via category-theoretic logical relations. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c38]Mayuko Kori, Natsuki Urabe, Shin-ya Katsumata, Kohei Suenaga, Ichiro Hasuo:
The Lattice-Theoretic Essence of Property Directed Reachability Analysis. CAV (1) 2022: 235-256 - [c37]Shota Motoura, Shin-ya Katsumata:
On Inverse Operators in Dynamic Epistemic Logic. LFCS 2022: 217-235 - [i21]Mayuko Kori, Natsuki Urabe, Shin-ya Katsumata, Kohei Suenaga, Ichiro Hasuo:
The Lattice-Theoretic Essence of PropertyDirected Reachability Analysis. CoRR abs/2203.14261 (2022) - [i20]Tetsuya Sato, Shin-ya Katsumata:
Divergences on Monads for Relational Program Logics. CoRR abs/2206.05716 (2022) - 2021
- [j5]David Sprunger, Shin-ya Katsumata, Jérémy Dubut, Ichiro Hasuo:
Fibrational bisimulations and quantitative reasoning: Extended version. J. Log. Comput. 31(6): 1526-1559 (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) - [c36]Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata:
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down. CONCUR 2021: 21:1-21:22 - [c35]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. ESOP 2021: 234-263 - [c34]Yoji Fukihara, Shin-ya Katsumata:
Generalized Bounded Linear Logic and its Categorical Semantics. FoSSaCS 2021: 226-246 - [c33]Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo:
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation. LICS 2021: 1-14 - [c32]Tsutomu Kobayashi, Rick Salay, Ichiro Hasuo, Krzysztof Czarnecki, Fuyuki Ishikawa, Shin-ya Katsumata:
Robustifying Controller Specifications of Cyber-Physical Systems Against Perceptual Uncertainty. NFM 2021: 198-213 - [c31]Clovis Eberhart, Akihisa Yamada, Stefan Klikovits, Shin-ya Katsumata, Tsutomu Kobayashi, Ichiro Hasuo, Fuyuki Ishikawa:
Architecture-Guided Test Resource Allocation via Logic. TAP@STAF 2021: 22-38 - [i19]Ichiro Hasuo, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata:
Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs. CoRR abs/2101.01502 (2021) - [i18]Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata:
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down. CoRR abs/2105.04817 (2021) - [i17]Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo:
Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation. CoRR abs/2105.10164 (2021) - [i16]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) - [i15]Clovis Eberhart, Akihisa Yamada, Stefan Klikovits, Shin-ya Katsumata, Tsutomu Kobayashi, Ichiro Hasuo, Fuyuki Ishikawa:
Architecture-Guided Test Resource Allocation Via Logic. CoRR abs/2107.10948 (2021) - [i14]Tsutomu Kobayashi, Rick Salay, Ichiro Hasuo, Krzysztof Czarnecki, Fuyuki Ishikawa, Shin-ya Katsumata:
Robustifying Controller Specifications of Cyber-Physical Systems Against Perceptual Uncertainty. CoRR abs/2108.07509 (2021) - 2020
- [c30]Koki Nishizawa, Shin-ya Katsumata, Yuichi Komorida:
Stone Dualities from Opfibrations. RAMiCS 2020: 221-236 - [c29]Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu:
Interaction Laws of Monads and Comonads. LICS 2020: 604-618 - [c28]Alejandro Aguirre, Shin-ya Katsumata:
Weakest Preconditions in Fibrations. MFPS 2020: 5-27 - [c27]Juraj Kolcák, Jérémy Dubut, Ichiro Hasuo, Shin-ya Katsumata, David Sprunger, Akihisa Yamada:
Relational Differential Dynamic Logic. TACAS (1) 2020: 191-208 - [i13]Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. CoRR abs/2007.11235 (2020)
2010 – 2019
- 2019
- [c26]Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo:
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching. FoSSaCS 2019: 523-540 - [c25]Juraj Kolcák, Ichiro Hasuo, Jérémy Dubut, Shin-ya Katsumata, David Sprunger, Akihisa Yamada:
Relational differential dynamic logic: poster abstract. HSCC 2019: 284-285 - [c24]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Probabilistic Relational Reasoning via Metrics. LICS 2019: 1-19 - [c23]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo:
Codensity Games for Bisimilarity. LICS 2019: 1-13 - [c22]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 - [c21]David Sprunger, Shin-ya Katsumata:
Differentiable Causal Computations via Delayed Trace. LICS 2019: 1-12 - [i12]Juraj Kolcák, Ichiro Hasuo, Jérémy Dubut, Shin-ya Katsumata, David Sprunger, Akihisa Yamada:
Relational Differential Dynamic Logic. CoRR abs/1903.00153 (2019) - [i11]David Sprunger, Shin-ya Katsumata:
Differentiable Causal Computations via Delayed Trace. CoRR abs/1903.01093 (2019) - [i10]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo:
Codensity Games for Bisimilarity. CoRR abs/1907.09634 (2019) - [i9]Shin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu:
Interaction laws of monads and comonads. CoRR abs/1912.13477 (2019) - 2018
- [j3]Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu:
Codensity Lifting of Monads and its Dual. Log. Methods Comput. Sci. 14(4) (2018) - [c20]David Sprunger, Shin-ya Katsumata, Jérémy Dubut, Ichiro Hasuo:
Fibrational Bisimulations and Quantitative Reasoning. CMCS 2018: 190-213 - [c19]Shin-ya Katsumata:
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads. FoSSaCS 2018: 110-127 - [i8]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Metric Semantics for Probabilistic Relational Reasoning. CoRR abs/1807.05091 (2018) - [i7]Jérémy Dubut, Ichiro Hasuo, Shin-ya Katsumata, David Sprunger:
Quantitative bisimulations using coreflections and open morphisms. CoRR abs/1809.09278 (2018) - [i6]Shin-ya Katsumata, Tetsuya Sato, Tarmo Uustalu:
Codensity Lifting of Monads and its Dual. CoRR abs/1810.07972 (2018) - [i5]Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo:
Path category for free - Open morphisms from coalgebras with non-deterministic branching. CoRR abs/1811.12294 (2018) - 2017
- [c18]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui:
A semantic account of metric preservation. POPL 2017: 545-556 - [i4]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui:
A Semantic Account of Metric Preservation. CoRR abs/1702.00374 (2017) - [i3]Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Reasoning about Divergences for Relaxations of Differential Privacy. CoRR abs/1710.09010 (2017) - [i2]Marco Gaboardi, Shin-ya Katsumata:
Semantics of Effects, Resources, and Applications (NII Shonan Meeting 2017-4). NII Shonan Meet. Rep. 2017 (2017) - [i1]Shin-ya Katsumata, Damien Pous, Jan Rutten:
Enhanced coinduction (NII Shonan Meeting 2017-17). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [c17]Soichiro Fujii, Shin-ya Katsumata, Paul-André Melliès:
Towards a Formal Theory of Graded Monads. FoSSaCS 2016: 513-530 - [c16]Marco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu:
Combining effects and coeffects via grading. ICFP 2016: 476-489 - 2015
- [c15]Shin-ya Katsumata, Tetsuya Sato:
Codensity Liftings of Monads. CALCO 2015: 156-170 - 2014
- [c14]Shin-ya Katsumata:
Parametric effect monads and semantics of effect systems. POPL 2014: 633-646 - 2013
- [j2]Shin-ya Katsumata:
Relating computational effects by ⊤⊤-lifting. Inf. Comput. 222: 228-246 (2013) - [c13]Shin-ya Katsumata, Tetsuya Sato:
Preorders on Monads and Coalgebraic Simulations. FoSSaCS 2013: 145-160 - 2012
- [c12]Koji Nakazawa, Shin-ya Katsumata:
Extensional Models of Untyped Lambda-mu Calculus. CL&C 2012: 35-47 - 2011
- [c11]Shin-ya Katsumata:
Relating Computational Effects by ⊤ ⊤-Lifting. ICALP (2) 2011: 174-185 - 2010
- [c10]Shin-ya Katsumata:
Categorical Descriptional Composition. APLAS 2010: 222-238
2000 – 2009
- 2008
- [j1]Shin-ya Katsumata, Susumu Nishimura:
Algebraic fusion of functions with an accumulating parameter and its improvement. J. Funct. Program. 18(5-6): 781-819 (2008) - [c9]Shin-ya Katsumata:
A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. CSL 2008: 278-292 - [c8]Shin-ya Katsumata:
Attribute Grammars and Categorical Semantics. ICALP (2) 2008: 271-282 - 2006
- [c7]Shin-ya Katsumata, Susumu Nishimura:
Algebraic fusion of functions with an accumulating parameter and its improvement. ICFP 2006: 227-238 - 2005
- [b1]Shin-ya Katsumata:
A generalisation of pre-logical predicates and its applications. University of Edinburgh, UK, 2005 - [c6]Shin-ya Katsumata:
A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage. CSL 2005: 87-102 - 2004
- [c5]Shin-ya Katsumata:
A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems. ICALP 2004: 831-845 - 2003
- [c4]Jo Erskine Hannay, Shin-ya Katsumata, Donald Sannella:
Semantic and Syntactic Approaches to Simulation Relations. MFCS 2003: 68-91 - 2002
- [c3]Shin-ya Katsumata:
Behavioural Equivalence and Indistinguishability in Higher-Order Typed Languages. WADT 2002: 284-298 - 2001
- [c2]Shin-ya Katsumata, Atsushi Ohori:
Proof-Directed De-compilation of Low-Level Code. ESOP 2001: 352-366 - [c1]Alan Mycroft, Atsushi Ohori, Shin-ya Katsumata:
Comparing Type-Based and Proof-Directed Decompilation. WCRE 2001: 362-367
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-20 23:59 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:
