| Linearity and the pi-calculus N Kobayashi, BC Pierce, DN Turner ACM Transactions on Programming Languages and Systems (TOPLAS) 21 (5), 914-947, 1999 | 574 | 1999 |
| A generic type system for the pi-calculus A Igarashi, N Kobayashi Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of …, 2001 | 324 | 2001 |
| A new type system for deadlock-free processes N Kobayashi International Conference on Concurrency Theory, 233-247, 2006 | 246 | 2006 |
| A partially deadlock-free typed process calculus N Kobayashi ACM transactions on programming languages and systems (toplas) 20 (2), 436-482, 1998 | 219 | 1998 |
| Types and higher-order recursion schemes for verification of higher-order programs N Kobayashi Proceedings of the 36th annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2009 | 204 | 2009 |
| A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes N Kobayashi, CHL Ong 2009 24th Annual IEEE Symposium on Logic In Computer Science, 179-188, 2009 | 187 | 2009 |
| Predicate abstraction and CEGAR for higher-order model checking N Kobayashi, R Sato, H Unno Proceedings of the 32nd ACM SIGPLAN conference on Programming language …, 2011 | 184 | 2011 |
| A type system for lock-free processes N Kobayashi Information and Computation 177 (2), 122-159, 2002 | 178 | 2002 |
| Type systems for concurrent programs N Kobayashi Formal Methods at the Crossroads. From Panacea to Foundational Support: 10th …, 2003 | 164 | 2003 |
| Resource usage analysis A Igarashi, N Kobayashi Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of …, 2002 | 154 | 2002 |
| Type-based information flow analysis for the π-calculus N Kobayashi Acta Informatica 42 (4), 291-347, 2005 | 149 | 2005 |
| Quasi-linear types N Kobayashi Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of …, 1999 | 126 | 1999 |
| ACL—A concurrent linear logic programming paradigm N Kobayashi, A Yonezawa Proceedings of the 1993 international symposium on Logic programming, 279-294, 1993 | 117 | 1993 |
| Environmental bisimulations for higher-order languages D Sangiorgi, N Kobayashi, E Sumii 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 293-302, 2007 | 114 | 2007 |
| Environmental bisimulations for higher-order languages D Sangiorgi, N Kobayashi, E Sumii ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (1), 1-69, 2011 | 110 | 2011 |
| Model checking higher-order programs N Kobayashi Journal of the ACM (JACM) 60 (3), 1-62, 2013 | 108 | 2013 |
| Higher-order multi-parameter tree transducers and recursion schemes for program verification N Kobayashi, N Tabuchi, H Unno ACM Sigplan Notices 45 (1), 495-508, 2010 | 99 | 2010 |
| Resource usage analysis A Igarashi, N Kobayashi ACM Transactions on Programming Languages and Systems (TOPLAS) 27 (2), 264-313, 2005 | 95 | 2005 |
| RustHorn: CHC-based verification for Rust programs Y Matsushita, T Tsukada, N Kobayashi ACM Transactions on Programming Languages and Systems (TOPLAS) 43 (4), 1-54, 2021 | 94 | 2021 |
| ICE-Based Refinement Type Discovery for Higher-Order Functional Programs A Champion, T Chiba, N Kobayashi, R Sato TACAS 2018, 365-384, 2018 | 88 | 2018 |
Takeshi TsukadaChiba UniversityVerified email at math.s.chiba-u.ac.jp
