×
Compute Distance To:
Author ID: tsukada.takeshi Recent zbMATH articles by "Tsukada, Takeshi"
Published as: Tsukada, Takeshi
Documents Indexed: 27 Publications since 2009
Co-Authors: 17 Co-Authors with 21 Joint Publications
126 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

18 Publications have been cited 39 times in 33 Documents Cited by Year
Nondeterminism in game semantics via sheaves. Zbl 1401.68177
Tsukada, Takeshi; Ong, C. H. Luke
5
2015
A logical foundation for environment classifiers. Zbl 1211.68065
Tsukada, Takeshi; Igarashi, Atsushi
4
2010
Almost every simply typed \(\lambda\)-term has a long \(\beta\)-reduction sequence. Zbl 1486.68035
Sin’ya, Ryoma; Asada, Kazuyuki; Kobayashi, Naoki; Tsukada, Takeshi
4
2017
Higher-order program verification via HFL model checking. Zbl 1418.68127
Kobayashi, Naoki; Tsukada, Takeshi; Watanabe, Keiichi
4
2018
Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs. Zbl 1497.68128
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
3
2018
Unsafe order-2 tree languages are context-sensitive. Zbl 1405.68167
Kobayashi, Naoki; Inaba, Kazuhiro; Tsukada, Takeshi
3
2014
Higher-order model checking in direct style. Zbl 1483.68206
Terao, Taku; Tsukada, Takeshi; Kobayashi, Naoki
2
2016
Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees. Zbl 1401.68207
Tsukada, Takeshi; Ong, C.-H. Luke
2
2014
Generalised species of rigid resource terms. Zbl 1452.03136
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
2
2017
RustHorn: CHC-based verification for Rust programs. Zbl 1508.68071
Matsushita, Yusuke; Tsukada, Takeshi; Kobayashi, Naoki
2
2020
Exact flow analysis by higher-order model checking. Zbl 1354.68050
Tobita, Yoshihiro; Tsukada, Takeshi; Kobayashi, Naoki
1
2012
An intersection type system for deterministic pushdown automata. Zbl 1362.68157
Tsukada, Takeshi; Kobayashi, Naoki
1
2012
Automatically disproving fair termination of higher-order functional programs. Zbl 1361.68153
Watanabe, Keiichi; Sato, Ryosuke; Tsukada, Takeshi; Kobayashi, Naoki
1
2016
A truly concurrent game model of the asynchronous \(\pi\)-calculus. Zbl 1486.68116
Sakayori, Ken; Tsukada, Takeshi
1
2017
Plays as resource terms via non-idempotent intersection types. Zbl 1401.68178
Tsukada, Takeshi; Ong, C.-H. Luke
1
2016
Complexity of model-checking call-by-value programs. Zbl 1405.68189
Tsukada, Takeshi; Kobayashi, Naoki
1
2014
Untyped recursion schemes and infinite intersection types. Zbl 1284.68139
Tsukada, Takeshi; Kobayashi, Naoki
1
2010
Streett automata model checking of higher-order recursion schemes. Zbl 1441.68135
Suzuki, Ryota; Fujima, Koichi; Kobayashi, Naoki; Tsukada, Takeshi
1
2017
RustHorn: CHC-based verification for Rust programs. Zbl 1508.68071
Matsushita, Yusuke; Tsukada, Takeshi; Kobayashi, Naoki
2
2020
Higher-order program verification via HFL model checking. Zbl 1418.68127
Kobayashi, Naoki; Tsukada, Takeshi; Watanabe, Keiichi
4
2018
Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs. Zbl 1497.68128
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
3
2018
Almost every simply typed \(\lambda\)-term has a long \(\beta\)-reduction sequence. Zbl 1486.68035
Sin’ya, Ryoma; Asada, Kazuyuki; Kobayashi, Naoki; Tsukada, Takeshi
4
2017
Generalised species of rigid resource terms. Zbl 1452.03136
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
2
2017
A truly concurrent game model of the asynchronous \(\pi\)-calculus. Zbl 1486.68116
Sakayori, Ken; Tsukada, Takeshi
1
2017
Streett automata model checking of higher-order recursion schemes. Zbl 1441.68135
Suzuki, Ryota; Fujima, Koichi; Kobayashi, Naoki; Tsukada, Takeshi
1
2017
Higher-order model checking in direct style. Zbl 1483.68206
Terao, Taku; Tsukada, Takeshi; Kobayashi, Naoki
2
2016
Automatically disproving fair termination of higher-order functional programs. Zbl 1361.68153
Watanabe, Keiichi; Sato, Ryosuke; Tsukada, Takeshi; Kobayashi, Naoki
1
2016
Plays as resource terms via non-idempotent intersection types. Zbl 1401.68178
Tsukada, Takeshi; Ong, C.-H. Luke
1
2016
Nondeterminism in game semantics via sheaves. Zbl 1401.68177
Tsukada, Takeshi; Ong, C. H. Luke
5
2015
Unsafe order-2 tree languages are context-sensitive. Zbl 1405.68167
Kobayashi, Naoki; Inaba, Kazuhiro; Tsukada, Takeshi
3
2014
Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees. Zbl 1401.68207
Tsukada, Takeshi; Ong, C.-H. Luke
2
2014
Complexity of model-checking call-by-value programs. Zbl 1405.68189
Tsukada, Takeshi; Kobayashi, Naoki
1
2014
Exact flow analysis by higher-order model checking. Zbl 1354.68050
Tobita, Yoshihiro; Tsukada, Takeshi; Kobayashi, Naoki
1
2012
An intersection type system for deterministic pushdown automata. Zbl 1362.68157
Tsukada, Takeshi; Kobayashi, Naoki
1
2012
A logical foundation for environment classifiers. Zbl 1211.68065
Tsukada, Takeshi; Igarashi, Atsushi
4
2010
Untyped recursion schemes and infinite intersection types. Zbl 1284.68139
Tsukada, Takeshi; Kobayashi, Naoki
1
2010

Citations by Year