基本信息
浏览量:34
职业迁徙
个人简介
Papers
Takeshi Tsukada and Koji Nakazawa: Intersection and Union Type Assignment and Polarised Lambda-Bar-Mu-Mu-Tilde. draft. (pdf)
Takeshi Tsukada and Naoki Kobayashi: Higher-Order Model Checking by Abstraction of Type Derivation Rewriting. draft. (pdf; benchmark programs used in the paper are here)
Kazuhide Yasukata, Takeshi Tsukada and Naoki Kobayashi: Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation. to appear APLAS 2016. (longer version: pdf).
Takeshi Tsukada and C.-H. Luke Ong: Plays as Resource Terms via Non-idempotent Intersection Types. In Proceedings of the 31st Annual ACM/IEEE Symposiun on Logic in Computer Science (LICS 2016). pp ???-???. IEEE (2016)
Takeshi Tsukada and C.-H. Luke Ong: Nondeterminism in Game Semantics via Sheaves. In Proceedings of the 30th Annual ACM/IEEE Symposiun on Logic in Computer Science (LICS 2015). pp 220-231. IEEE (2015)
Takeshi Tsukada and C.-H. Luke Ong: Compositional Higher-Order Model Checking via Omega-Regular Games over Böhm Trees. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (CSL-LICS 2014). pp 78:1--78:10. ACM (2014) (longer version: pdf).
Takeshi Tsukada and Naoki Kobayashi: Complexity of Model-Checking Call-by-Value Programs. In Proceedings of 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2014). pp 180-194. LNCS 8412, Springer (2014) (author version: pdf)
Naoki Kobayashi, Kazuhiro Inaba and Takeshi Tsukada: Unsafe Order-2 Tree Languages are Context-Sensitive. In Proceedings of 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2014). pp 149-163. LNCS 8412, Springer (2014)
Takeshi Tsukada and Naoki Kobayashi: An Intersection Type System for Deterministic Pushdown Automata. In Proceedings of 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012. The Netherlands, September, 2012. (Long version: pdf)
C.-H. Luke Ong and Takeshi Tsukada: Two-Level Game Semantics, Intersection Types and Recursion Schemes. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012). University of Warwick, UK, July, 2012.
Yoshihiro Tobita, Takeshi Tsukada and Naoki Kobayashi: Exact Flow Analysis by Higher-Order Model Checking. In Proceedings of Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012), Kobe, Japan, Jun, 2012.
Takeshi Tsukada and Atsushi Igarashi: A logical foundation for environment classifiers. Logical Methods in Computer Science. Vol.6 (4:8), pp.1-43, 2010. ( arXiv )
Takeshi Tsukada and Naoki Kobayashi: Untyped Recursion Schemes and Infinite Intersection Types. In Proceedings of 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2010), Paphos, Cyprus. March, 2010. ( PDF )
Takeshi Tsukada and Atsushi Igarashi: A logical foundation for environment classifiers. In Proceedings of 9th International Conference on Typed Lambda-Calculi and Applications (TLCA 2009), Brasília, Brazil. July, 2009. ( PDF, PS; journal version is also available )
Slides
研究兴趣
论文共 86 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRRno. POPL (2023): 362-392
Proc. ACM Program. Lang.no. POPL (2023): 604-631
ACM Transactions on Programming Languages and Systemsno. 4 (2021): 1-54
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn