| 両方とも前のリビジョン 前のリビジョン 次のリビジョン | 前のリビジョン |
| ja:start [2024/04/23 12:28] – [研究室学生の対外発表] asada | ja:start [2024/04/23 12:34] (現在) – [テーブル] asada |
|---|
| |
| ===== 出版論文 ===== | ===== 出版論文 ===== |
| ^ 論文DL ^ 出版年 ^ 論文タイトル ^ 著者名 ^ 雑誌・会議名 ^ | ^ 論文DL ^ 出版年 ^ 論文タイトル ^ 著者名 ^ 雑誌・会議名 ^ |
| | | 2023 | Compositional Probabilistic Model Checking with String Diagrams of MDPs | Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, and Ichiro Hasuo | [[http://www.i-cav.org/2023/|Computer Aided Verification (CAV 2023)]] | | | [[https://doi.org/10.1145/3632855|doi]] | 2024 | Enriched Presheaf Model of Quantum FPC | Takeshi Tsukada and Kazuyuki Asada | [[https://popl24.sigplan.org/|Principles of Programming Languages (POPL 2024)]] | |
| | [[https://doi.org/10.1007/978-3-031-19135-0_8|doi]] | 2022 | On Higher-Order Reachability Games vs May Reachability | Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi | [[https://rp2022.mpi-sws.org/index.html|Reachability Problems (RP 2022)]] | | | [[https://doi.org/10.1007/978-3-031-37709-9_3|doi]] | 2023 | Compositional Probabilistic Model Checking with String Diagrams of MDPs | Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, and Ichiro Hasuo | [[http://www.i-cav.org/2023/|Computer Aided Verification (CAV 2023)]] | |
| | [[https://dl.acm.org/doi/10.1145/3531130.3533373|doi]] | 2022 | Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings | Takeshi Tsukada and Kazuyuki Asada | [[https://lics.siglog.org/lics22/index.php|Logic in Computer Science (LICS 2022)]] | | | [[https://doi.org/10.1007/978-3-031-19135-0_8|doi]] | 2022 | On Higher-Order Reachability Games vs May Reachability | Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi | [[https://rp2022.mpi-sws.org/index.html|Reachability Problems (RP 2022)]] | |
| | [[https://doi.org/10.4204/EPTCS.351.17|doi]] | 2021 | A Compositional Approach to Parity Games | Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, and Ichiro Hasuo | [[https://www.coalg.org/calco-mfps2021/|Mathematical Foundations of Programming Semantics (MFPS 2021)]] | | | [[https://dl.acm.org/doi/10.1145/3531130.3533373|doi]] | 2022 | Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings | Takeshi Tsukada and Kazuyuki Asada | [[https://lics.siglog.org/lics22/index.php|Logic in Computer Science (LICS 2022)]] | |
| | [[https://doi.org/10.4230/LIPIcs.MFCS.2021.79|doi]] | 2021 | Idempotent Turing Machines | Keisuke Nakano | [[https://compose.ioc.ee/mfcs/|Mathematical Foundations of Computer Science (MFCS 2021)]] | | | [[https://doi.org/10.4204/EPTCS.351.17|doi]] | 2021 | A Compositional Approach to Parity Games | Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, and Ichiro Hasuo | [[https://www.coalg.org/calco-mfps2021/|Mathematical Foundations of Programming Semantics (MFPS 2021)]] | |
| | [[https://doi.org/10.1007/978-3-030-79837-6_11|doi]] | 2021 | A Tangled Web of 12 Lens Laws | Keisuke Nakano | [[https://reversible-computation-2021.github.io/|Reversible Computation (RC 2021)]] | | | [[https://doi.org/10.4230/LIPIcs.MFCS.2021.79|doi]] | 2021 | Idempotent Turing Machines | Keisuke Nakano | [[https://compose.ioc.ee/mfcs/|Mathematical Foundations of Computer Science (MFCS 2021)]] | |
| | [[https://doi.org/10.1007/978-3-030-52482-1_3|doi]] | 2020 | Involutory Turing Machines | Keisuke Nakano | [[https://reversible-computation-2020.github.io/|Reversible Computation (RC 2020)]] | | | [[https://doi.org/10.1007/978-3-030-79837-6_11|doi]] | 2021 | A Tangled Web of 12 Lens Laws | Keisuke Nakano | [[https://reversible-computation-2021.github.io/|Reversible Computation (RC 2021)]] | |
| | [[https://doi.org/10.23638/LMCS-16(2:8)2020|doi]] | 2020 | On properties of B-terms | Mirai Ikebuchi and Keisuke Nakano | Logical Methods in Computer Science | | | [[https://doi.org/10.1007/978-3-030-52482-1_3|doi]] | 2020 | Involutory Turing Machines | Keisuke Nakano | [[https://reversible-computation-2020.github.io/|Reversible Computation (RC 2020)]] | |
| | [[https://doi.org/10.4230/LIPIcs.FSCD.2020.22|doi]] | 2020 | Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars | Kazuyuki Asada and Naoki Kobayashi | [[https://fscd2020.org/|Formal Structures for Computation and Deduction (FSCD 2020)]] | | | [[https://doi.org/10.23638/LMCS-16(2:8)2020|doi]] | 2020 | On properties of B-terms | Mirai Ikebuchi and Keisuke Nakano | Logical Methods in Computer Science | |
| | [[https://doi.org/10.4230/LIPIcs.FSCD.2020.21|doi]] | 2020 | On Average-Case Hardness of Higher-Order Model Checking | Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, and Takeshi Tsukada | [[https://fscd2020.org/|Formal Structures for Computation and Deduction (FSCD 2020)]] | | | [[https://doi.org/10.4230/LIPIcs.FSCD.2020.22|doi]] | 2020 | Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars | Kazuyuki Asada and Naoki Kobayashi | [[https://fscd2020.org/|Formal Structures for Computation and Deduction (FSCD 2020)]] | |
| | [[https://doi.org/10.1016/j.tcs.2020.12.033|doi]] | 2020 | Streaming Ranked-Tree-to-String Transducers | Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano | Theoretical Computer Science | | | [[https://doi.org/10.4230/LIPIcs.FSCD.2020.21|doi]] | 2020 | On Average-Case Hardness of Higher-Order Model Checking | Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, and Takeshi Tsukada | [[https://fscd2020.org/|Formal Structures for Computation and Deduction (FSCD 2020)]] | |
| | [[https://doi.org/10.1007/978-3-030-23679-3_19|doi]] | 2019 | Streaming Ranked-Tree-to-String Transducers | Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano | [[https://im.saske.sk/ciaa2019/|Implementation and Application of Automata (CIAA 2019)]] | | | [[https://doi.org/10.1016/j.tcs.2020.12.033|doi]] | 2020 | Streaming Ranked-Tree-to-String Transducers | Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano | Theoretical Computer Science | |
| | [[https://doi.org/10.1109/BIGCOMP.2019.8679145|doi]] | 2019 | Toward BX-based Architecture for Controlling and Sharing Distributed Data | Yasunori Ishihara, Hiroyuki Kato, Keisuke Nakano, Makoto Onizuka, and Yuya Sasaki | [[http://www.prg.nii.ac.jp/projects/biscuits/second-workshop/|Software Foundations for Data Interoperability (SFDI 2019)]] | | | [[https://doi.org/10.1007/978-3-030-23679-3_19|doi]] | 2019 | Streaming Ranked-Tree-to-String Transducers | Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano | [[https://im.saske.sk/ciaa2019/|Implementation and Application of Automata (CIAA 2019)]] | |
| | [[https://doi.org/10.1109/BIGCOMP.2019.8679236|doi]] | 2019 | Flexible framework for data integration and update propagation: system aspect | Yasuhito Asano, Dennis-Florian Herr, Yasunori Ishihara, Hiroyuki Kato, Keisuke Nakano, Makoto Onizuka, and Yuya Sasaki | [[http://www.prg.nii.ac.jp/projects/biscuits/second-workshop/|Software Foundations for Data Interoperability (SFDI 2019)]] | | | [[https://doi.org/10.1109/BIGCOMP.2019.8679145|doi]] | 2019 | Toward BX-based Architecture for Controlling and Sharing Distributed Data | Yasunori Ishihara, Hiroyuki Kato, Keisuke Nakano, Makoto Onizuka, and Yuya Sasaki | [[http://www.prg.nii.ac.jp/projects/biscuits/second-workshop/|Software Foundations for Data Interoperability (SFDI 2019)]] | |
| | [[https://doi.org/10.4230/LIPIcs.FSTTCS.2018.14|doi]] | 2018 | Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered | Kazuyuki Asada and Naoki Kobayashi | [[https://www.fsttcs.org.in/archives/2018/|Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)]] | | | [[https://doi.org/10.1109/BIGCOMP.2019.8679236|doi]] | 2019 | Flexible framework for data integration and update propagation: system aspect | Yasuhito Asano, Dennis-Florian Herr, Yasunori Ishihara, Hiroyuki Kato, Keisuke Nakano, Makoto Onizuka, and Yuya Sasaki | [[http://www.prg.nii.ac.jp/projects/biscuits/second-workshop/|Software Foundations for Data Interoperability (SFDI 2019)]] | |
| | [[https://doi.org/10.4230/LIPIcs.FSCD.2018.18|doi]] | 2018 | On repetitive right application of B-terms | Mirai Ikebuchi and Keisuke Nakano | [[https://www.cs.le.ac.uk/events/fscd2018/|Formal Structures for Computation and Deduction (FSCD 2018)]] | | | [[https://doi.org/10.4230/LIPIcs.FSTTCS.2018.14|doi]] | 2018 | Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered | Kazuyuki Asada and Naoki Kobayashi | [[https://www.fsttcs.org.in/archives/2018/|Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)]] | |
| | [[https://doi.org/10.11309/jssst.35.52|doi]] | 2018 | 木から文字列への決定性トップダウン変換の等価性判定アルゴリズムの実用性について | 高橋 祐多, 中野 圭介 | コンピュータ ソフトウェア | | | [[https://doi.org/10.4230/LIPIcs.FSCD.2018.18|doi]] | 2018 | On repetitive right application of B-terms | Mirai Ikebuchi and Keisuke Nakano | [[https://www.cs.le.ac.uk/events/fscd2018/|Formal Structures for Computation and Deduction (FSCD 2018)]] | |
| | | [[https://doi.org/10.11309/jssst.35.52|doi]] | 2018 | 木から文字列への決定性トップダウン変換の等価性判定アルゴリズムの実用性について | 高橋 祐多, 中野 圭介 | コンピュータ ソフトウェア | |
| |
| ===== メンバー ===== | ===== メンバー ===== |