2009 |
70 | EE | Daisuke Kikuchi,
Naoki Kobayashi:
Type-Based Automated Verification of Authenticity in Cryptographic Protocols.
ESOP 2009: 222-236 |
69 | EE | Naoki Kobayashi:
Types and higher-order recursion schemes for verification of higher-order programs.
POPL 2009: 416-428 |
2008 |
68 | EE | Naoki Kobayashi,
Davide Sangiorgi:
A Hybrid Type System for Lock-Freedom of Mobile Processes.
CAV 2008: 80-93 |
67 | EE | Yûta Kaneko,
Naoki Kobayashi:
Linear Declassification.
ESOP 2008: 224-238 |
66 | EE | Naoki Kobayashi:
Substructural Type Systems for Program Analysis.
FLOPS 2008: 14 |
65 | EE | Hiroshi Unno,
Naoki Kobayashi:
On-Demand Refinement of Dependent Types.
FLOPS 2008: 81-96 |
64 | EE | Naoki Kobayashi,
Hitoshi Ohsaki:
Tree Automata for Non-linear Arithmetic.
RTA 2008: 291-305 |
63 | EE | Reynald Affeldt,
Naoki Kobayashi:
A Coq Library for Verification of Concurrent Programs.
Electr. Notes Theor. Comput. Sci. 199: 17-32 (2008) |
62 | EE | Koichi Kodama,
Kohei Suenaga,
Naoki Kobayashi:
Translation of tree-processing programs into stream-processing programs based on ordered linear type.
J. Funct. Program. 18(3): 333-371 (2008) |
61 | EE | Futoshi Iwama,
Naoki Kobayashi:
A New Type System for JVM Lock Primitives.
New Generation Comput. 26(2): 125-170 (2008) |
2007 |
60 | EE | Daisuke Kikuchi,
Naoki Kobayashi:
Type-Based Verification of Correspondence Assertions for Communication Protocols.
APLAS 2007: 191-205 |
59 | EE | Kohei Suenaga,
Naoki Kobayashi:
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts.
ESOP 2007: 490-504 |
58 | EE | Davide Sangiorgi,
Naoki Kobayashi,
Eijiro Sumii:
Logical Bisimulations and Functional Languages.
FSEN 2007: 364-379 |
57 | EE | Naoki Kobayashi,
Takashi Suto:
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus.
ICALP 2007: 740-751 |
56 | EE | Davide Sangiorgi,
Naoki Kobayashi,
Eijiro Sumii:
Environmental Bisimulations for Higher-Order Languages.
LICS 2007: 293-302 |
55 | EE | Romain Demangeon,
Daniel Hirschkoff,
Naoki Kobayashi,
Davide Sangiorgi:
On the Complexity of Termination Inference for Processes.
TGC 2007: 140-155 |
2006 |
54 | | Naoki Kobayashi:
Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006, Proceedings
Springer 2006 |
53 | EE | Naoki Kobayashi:
A New Type System for Deadlock-Free Processes.
CONCUR 2006: 233-247 |
52 | EE | Futoshi Iwama,
Atsushi Igarashi,
Naoki Kobayashi:
Resource usage analysis for a functional language with exceptions.
PEPM 2006: 38-47 |
51 | EE | Hiroshi Unno,
Naoki Kobayashi,
Akinori Yonezawa:
Combining type-based analysis and model checking for finding counterexamples against non-interference.
PLAS 2006: 17-26 |
50 | EE | Naoki Kobayashi,
Kohei Suenaga,
Lucian Wischik:
Resource Usage Analysis for the pi-Calculus.
VMCAI 2006: 298-312 |
49 | EE | Naoki Kobayashi,
Kohei Suenaga,
Lucian Wischik:
Resource Usage Analysis for the Pi-Calculus
CoRR abs/cs/0608035: (2006) |
48 | EE | Naoki Kobayashi,
Kohei Suenaga,
Lucian Wischik:
Resource Usage Analysis for the p-Calculus.
Logical Methods in Computer Science 2(3): (2006) |
2005 |
47 | EE | Kohei Suenaga,
Naoki Kobayashi,
Akinori Yonezawa:
Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives.
LOPSTR 2005: 98-114 |
46 | EE | Atsushi Igarashi,
Naoki Kobayashi:
Resource usage analysis.
ACM Trans. Program. Lang. Syst. 27(2): 264-313 (2005) |
45 | EE | Naoki Kobayashi:
Type-based information flow analysis for the pi-calculus.
Acta Inf. 42(4-5): 291-347 (2005) |
44 | EE | Reynald Affeldt,
Naoki Kobayashi:
Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes.
Electr. Notes Theor. Comput. Sci. 128(2): 151-168 (2005) |
2004 |
43 | EE | Akihito Nagata,
Naoki Kobayashi,
Akinori Yonezawa:
Region-Based Memory Management for a Dynamically-Typed Language.
APLAS 2004: 229-245 |
42 | EE | Koichi Kodama,
Kohei Suenaga,
Naoki Kobayashi:
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type.
APLAS 2004: 41-56 |
41 | EE | Atsushi Igarashi,
Naoki Kobayashi:
A generic type system for the Pi-calculus.
Theor. Comput. Sci. 311(1-3): 121-163 (2004) |
2003 |
40 | EE | Naoki Kobayashi:
Useless Code Elimination and Programm Slicing for the Pi-Calculus.
APLAS 2003: 55-72 |
39 | EE | Naoki Kobayashi:
Time regions and effects for resource usage analysis.
TLDI 2003: 50-61 |
38 | EE | Naoki Kobayashi:
Time regions and effects for resource usage analysis.
TLDI 2003: 50-61 |
37 | EE | Naoki Kobayashi,
Benjamin C. Pierce:
Information and Computation special issue from TACS 2001.
Inf. Comput. 186(2): 163-164 (2003) |
2002 |
36 | EE | Naoki Kobayashi:
Type Systems for Concurrent Programs.
10th Anniversary Colloquium of UNU/IIST 2002: 439-453 |
35 | | Naoki Kobayashi,
Keita Shirane:
Type-Based Information Analysis for Low-Level Languages.
APLAS 2002: 302-316 |
34 | EE | Futoshi Iwama,
Naoki Kobayashi:
A new type system for JVM lock primitives.
ASIA-PEPM 2002: 71-82 |
33 | EE | Etsuya Shibayama,
Shigeki Hagihara,
Naoki Kobayashi,
Shin-ya Nishizaki,
Kenjiro Taura,
Takuo Watanabe:
AnZenMail: A Secure and Certified E-mail System.
ISSS 2002: 201-216 |
32 | EE | Reynald Affeldt,
Naoki Kobayashi:
Formalization and Verification of a Mail Server in Coq.
ISSS 2002: 217-233 |
31 | EE | Atsushi Igarashi,
Naoki Kobayashi:
Resource usage analysis.
POPL 2002: 331-342 |
30 | EE | Naoki Kobayashi:
A Type System for Lock-Free Processes.
Inf. Comput. 177(2): 122-159 (2002) |
2001 |
29 | | Naoki Kobayashi,
Benjamin C. Pierce:
Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings
Springer 2001 |
28 | | Atsushi Igarashi,
Naoki Kobayashi:
Resource Usage Analysis.
APLAS 2001: 147-158 |
27 | EE | Atsushi Igarashi,
Naoki Kobayashi:
A generic type system for the Pi-calculus.
POPL 2001: 128-141 |
26 | EE | Naoki Kobayashi,
Takaaki Hosoya,
Michito Adachi,
Tamami Haku,
Koichi Yamaguchi:
Virtual MR microscopy for unruptured aneurysm.
Computer Methods and Programs in Biomedicine 66(1): 99-103 (2001) |
25 | | Eijiro Sumii,
Naoki Kobayashi:
A Hybrid Approach to Online and Offline Partial Evaluation.
Higher-Order and Symbolic Computation 14(2-3): 101-142 (2001) |
24 | | Naoki Kobayashi:
Type-Based Useless-Variable Elimination.
Higher-Order and Symbolic Computation 14(2-3): 221-260 (2001) |
2000 |
23 | EE | Naoki Kobayashi,
Shin Saito,
Eijiro Sumii:
An Implicitly-Typed Deadlock-Free Process Calculus.
CONCUR 2000: 489-503 |
22 | EE | Naoki Kobayashi:
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness.
IFIP TCS 2000: 365-389 |
21 | EE | Eijiro Sumii,
Naoki Kobayashi:
Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract).
PEPM 2000: 12-21 |
20 | EE | Naoki Kobayashi:
Type-Based Useless Variable Elimination.
PEPM 2000: 84-93 |
19 | | Atsushi Igarashi,
Naoki Kobayashi:
Type Reconstruction for Linear -Calculus with I/O Subtyping.
Inf. Comput. 161(1): 1-44 (2000) |
1999 |
18 | | Naoki Kobayashi,
Akinori Yonezawa:
Distributed and concurrent objects based on linear logic (Invited Talk).
FMOODS 1999 |
17 | EE | Naoki Kobayashi:
Quasi-Linear Types.
POPL 1999: 29-42 |
16 | EE | Naoki Kobayashi,
Benjamin C. Pierce,
David N. Turner:
Linearity and the pi-calculus.
ACM Trans. Program. Lang. Syst. 21(5): 914-947 (1999) |
15 | EE | Naoki Kobayashi,
Toshihiro Shimizu,
Akinori Yonezawa:
Distributed Concurrent Linear Logic Programming.
Theor. Comput. Sci. 227(1-2): 185-220 (1999) |
1998 |
14 | EE | Naoki Kobayashi:
Type-Based Analysis of Concurrent Programs.
Types in Compilation 1998: 272 |
13 | EE | Naoki Kobayashi:
A Partially Deadlock-Free Typed Process Calculus.
ACM Trans. Program. Lang. Syst. 20(2): 436-482 (1998) |
12 | EE | Eijiro Sumii,
Naoki Kobayashi:
A Generalized Deadlock-Free Process Calculus.
Electr. Notes Theor. Comput. Sci. 16(3): (1998) |
1997 |
11 | EE | Naoki Kobayashi:
A Partially Deadlock-Free Typed Process Calculus.
LICS 1997: 128-139 |
10 | | Atsushi Igarashi,
Naoki Kobayashi:
Type-Based Analysis of Communication for Concurrent Programming Languages.
SAS 1997: 187-201 |
1996 |
9 | | Haruo Hosoya,
Naoki Kobayashi,
Akinori Yonezawa:
Partial Evaluation Scheme for Concurrent Languages and Its Correctness.
Euro-Par, Vol. I 1996: 625-632 |
8 | EE | Naoki Kobayashi,
Benjamin C. Pierce,
David N. Turner:
Linearity and the Pi-Calculus.
POPL 1996: 358-371 |
1995 |
7 | | Naoki Kobayashi,
Motoki Nakade,
Akinori Yonezawa:
Static Analysis of Communication for Asynchronous Concurrent Programming Languages
SAS 1995: 225-242 |
6 | | Naoki Kobayashi,
Akinori Yonezawa:
Asynchronous Communication Model Based on Linear Logic.
Formal Asp. Comput. 7(2): 113-149 (1995) |
5 | | Naoki Kobayashi,
Akinori Yonezawa:
Towards Foundations of Concurrent Object-Oriented Programming-Types and Language Design.
TAPOS 1(4): 243-268 (1995) |
1994 |
4 | | Naoki Kobayashi,
Akinori Yonezawa:
Type-Theoretic Foundations for Concurrent Object-Oriented Programming.
OOPSLA 1994: 31-45 |
3 | | Naoki Kobayashi,
Akinori Yonezawa:
Higher-Order Concurrent Linear Logic Programming.
Theory and Practice of Parallel Programming 1994: 137-166 |
1993 |
2 | | Naoki Kobayashi,
Akinori Yonezawa:
ACL - A Concurrent Linear Logic Programming Paradigm.
ILPS 1993: 279-294 |
1992 |
1 | | Naoki Kobayashi,
Akinori Yonezawa:
Asynchronous Communication Model Based on Linear Logic.
Parallel Symbolic Computing 1992: 331-336 |