フォロー
Takeshi Tsukada
Takeshi Tsukada
確認したメール アドレス: math.s.chiba-u.ac.jp - ホームページ
タイトル
引用先
引用先
Nondeterminism in game semantics via sheaves
T Tsukada, CHL Ong
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 220-231, 2015
372015
Compositional higher-order model checking via ω-regular games over Böhm trees
T Tsukada, CHL Ong
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
322014
A logical foundation for environment classifiers
A Igarashi, T Tsukada
Logical Methods in Computer Science 6, 2010
292010
Higher-order program verification via HFL model checking
N Kobayashi, T Tsukada, K Watanabe
European Symposium on Programming, 711-738, 2018
282018
RustHorn: CHC-Based Verification for Rust Programs.
Y Matsushita, T Tsukada, N Kobayashi
ESOP, 484-514, 2020
272020
Generalised species of rigid resource terms
T Tsukada, K Asada, CHL Ong
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
262017
Species, profunctors and taylor expansion weighted by SMCC: A unified framework for modelling nondeterministic, probabilistic and quantum programs
T Tsukada, K Asada, CHL Ong
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
192018
Untyped recursion schemes and infinite intersection types
T Tsukada, N Kobayashi
International Conference on Foundations of Software Science and …, 2010
192010
Two-level game semantics, intersection types, and recursion schemes
CHL Ong, T Tsukada
International Colloquium on Automata, Languages, and Programming, 325-336, 2012
172012
Innocent Strategies are Sheaves over Plays---Deterministic, Non-deterministic and Probabilistic Innocence
T Tsukada, CHL Ong
arXiv preprint arXiv:1409.2764, 2014
152014
Exact flow analysis by higher-order model checking
Y Tobita, T Tsukada, N Kobayashi
International Symposium on Functional and Logic Programming, 275-289, 2012
142012
Reduction from branching-time property verification of higher-order programs to HFL validity checking
K Watanabe, T Tsukada, H Oshikawa, N Kobayashi
Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and …, 2019
132019
Unsafe order-2 tree languages are context-sensitive
N Kobayashi, K Inaba, T Tsukada
International Conference on Foundations of Software Science and Computation …, 2014
102014
Plays as resource terms via non-idempotent intersection types
T Tsukada, CHL Ong
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
82016
Almost Every Simply Typed -Term Has a Long -Reduction Sequence
R Sin’Ya, K Asada, N Kobayashi, T Tsukada
International Conference on Foundations of Software Science and Computation …, 2017
72017
A Truly Concurrent Game Model of the Asynchronous -Calculus
K Sakayori, T Tsukada
International Conference on Foundations of Software Science and Computation …, 2017
72017
Streett automata model checking of higher-order recursion schemes
R Suzuki, K Fujima, N Kobayashi, T Tsukada
2nd International Conference on Formal Structures for Computation and …, 2017
72017
Automated synthesis of functional programs with auxiliary functions
S Eguchi, N Kobayashi, T Tsukada
Asian Symposium on Programming Languages and Systems, 223-241, 2018
62018
Automatically disproving fair termination of higher-order functional programs
K Watanabe, R Sato, T Tsukada, N Kobayashi
ACM SIGPLAN Notices 51 (9), 243-255, 2016
62016
On computability of logical approaches to branching-time property verification of programs
T Tsukada
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
52020
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20