Kazuyuki Asada

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 27

Top Topics

Graph Transformation

Top Venues

Publications

Takeshi Tsukada, Kazuyuki Asada
Enriched Presheaf Model of Quantum FPC. Proc. ACM Program. Lang. 8 (POPL) (2024)
Takeshi Tsukada, Kazuyuki Asada
Enriched Presheaf Model of Quantum FPC. CoRR (2023)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CoRR (2023)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
Compositional Solution of Mean Payoff Games by String Diagrams. CoRR (2023)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CAV (3) (2023)
Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
On Higher-Order Reachability Games vs May Reachability. CoRR (2022)
Takeshi Tsukada, Kazuyuki Asada
Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings. CoRR (2022)
Takeshi Tsukada, Kazuyuki Asada
Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱. LICS (2022)
Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
On Higher-Order Reachability Games Vs May Reachability. RP (2022)
Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano
Streaming ranked-tree-to-string transducers. Theor. Comput. Sci. 870 (2021)
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo
A Compositional Approach to Parity Games. CoRR (2021)
Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
On Average-Case Hardness of Higher-Order Model Checking. FSCD (2020)
Kazuyuki Asada, Naoki Kobayashi
Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars. FSCD (2020)
Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano
Streaming Ranked-Tree-to-String Transducers. CIAA (2019)
Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. Log. Methods Comput. Sci. 15 (1) (2019)
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics. Math. Struct. Comput. Sci. 28 (2) (2018)
Kazuyuki Asada, Naoki Kobayashi
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered. FSTTCS (2018)
Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong
Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs. LICS (2018)
Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. CoRR (2018)
Kazuyuki Asada, Naoki Kobayashi
Pumping Lemma for Higher-order Languages. ICALP (2017)
Kazutaka Matsuda, Kazuyuki Asada
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. PEPM (2017)
Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. FoSSaCS (2017)
Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong
Generalised species of rigid resource terms. LICS (2017)
Kazuyuki Asada, Naoki Kobayashi
Pumping Lemma for Higher-order Languages. CoRR (2017)
Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi
Verifying relational properties of functional programs by first-order refinement. Sci. Comput. Program. 137 (2017)
Kazuyuki Asada, Naoki Kobayashi
On Word and Frontier Languages of Unsafe Higher-Order Grammars. ICALP (2016)
Kazuyuki Asada, Naoki Kobayashi
On Word and Frontier Languages of Unsafe Higher-Order Grammars. CoRR (2016)
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics. CoRR (2015)
Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi
Decision Algorithms for Checking Definability of Order-2 Finitary PCF. APLAS (2015)
Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi
Verifying Relational Properties of Functional Programs by First-Order Refinement. PEPM (2015)
Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi
Refinement Type Checking via Assertion Checking. J. Inf. Process. 23 (6) (2015)
Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano
Structural recursion for querying ordered graphs. ICFP (2013)
Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano
A parameterized graph transformation calculus for finite graphs with monadic branches. PPDP (2013)
Kazuyuki Asada, Ichiro Hasuo
Categorifying Computations into Components via Arrows as Profunctors. CMCS (2010)
Kazuyuki Asada
Arrows Are Strong Monads. MSFP@ICFP (2010)
Kazuyuki Asada
Extensional Universal Types for Call-by-Value. APLAS (2008)