| 2026 | FSCD | Stabilized Profunctors and Matrix Representation. | Takeshi Tsukada, Kazuyuki Asada, Kengo Hirata |
| 2026 | RC | PisoLang: a User-Friendly Reversible Programming Language with Inductive Types. | Kosuke Onodera, Keisuke Nakano, Kazuyuki Asada, Kentaro Kikuchi |
| 2025 | PEPM | Characterizations of Partial Well-Behaved Lenses. | Keishi Hashiba, Keisuke Nakano, Kazuyuki Asada, Kentaro Kikuchi |
| 2023 | CAV | Compositional Probabilistic Model Checking with String Diagrams of MDPs. | Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo |
| 2022 | LICS | Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱. | Takeshi Tsukada, Kazuyuki Asada |
| 2020 | FSCD | Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars. | Kazuyuki Asada, Naoki Kobayashi |
| 2020 | FSCD | On Average-Case Hardness of Higher-Order Model Checking. | Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada |
| 2018 | LICS | Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs. | Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong |
| 2017 | FOSSACS | Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. | Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada |
| 2017 | ICALP | Pumping Lemma for Higher-order Languages. | Kazuyuki Asada, Naoki Kobayashi |
| 2017 | LICS | Generalised species of rigid resource terms. | Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong |
| 2017 | PEPM | A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. | Kazutaka Matsuda, Kazuyuki Asada |
| 2016 | ICALP | On Word and Frontier Languages of Unsafe Higher-Order Grammars. | Kazuyuki Asada, Naoki Kobayashi |
| 2015 | APLAS | Decision Algorithms for Checking Definability of Order-2 Finitary PCF. | Sadaaki Kawata, Kazuyuki Asada, Naoki Kobayashi |
| 2015 | PEPM | Verifying Relational Properties of Functional Programs by First-Order Refinement. | Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi |
| 2013 | ICFP | Structural recursion for querying ordered graphs. | Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano |
| 2013 | PPDP | A parameterized graph transformation calculus for finite graphs with monadic branches. | Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano |
| 2010 | ICFP | Arrows Are Strong Monads. | Kazuyuki Asada |
| 2008 | APLAS | Extensional Universal Types for Call-by-Value. | Kazuyuki Asada |