Electronic copies of most of the papers listed below are available:
Send email to koba@is.s.u-tokyo.ac.jp .
Notice: The documents distributed by this server have been
provided by the contributing authors as a means to ensure timely
dissemination of scholarly and technical work on a noncommercial basis.
Copyright and all rights therein are maintained by the authors or by
other copyright holders, notwithstanding that they have offered their
works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by
each author's copyright. These works may not be reposted without the
explicit permission of the copyright holder.
Slides
-
"Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness"
(Slides)
- Naoki Kobayashi
- Invited talk at IFIP TCS2000, August 2000, Sendai.
-
"Distributed and Concurrent Objects Based on Linear Logic"
( slides
)
- Naoki Kobayashi and Akinori Yonezawa
- Invited Talk at FMOODS'99, Florence, Italy.
-
"Type-Based Analysis of Concurrent Programs"
( slides
: It is recommended to view this file with a PS previewer, rather than to print it on papers, because animation effect is achieved by using multiple pages.)
- Naoki Kobayashi
- Invited Talk at Second International Workshop on Types in Compilation (TIC'98)
Papers
-
"A Generic Type System for the Pi-Calculus"
(
abstract
)
(Summary ©2000 ACM)
- Atsushi Igarashi and Naoki Kobayashi
- The previous title was
"Unifying Framework of Type Systems for Concurrent Processes"
The summary will appear in Proceedings of POPL 2001.
A full version will be published as a technical report from
Department of Information Science,
University of Tokyo.
-
"An Implicitly-Typed Deadlock-Free Process Calculus"
(
abstract
) (Summary
©2000 Springer)
( Full Paper )
- Naoki Kobayashi, Shin Saito, and Eijiro Sumii
- A summary will be presented at CONCUR2000.
A preliminary version of the full paper has been published as
Technical Report TR00-01, Department of Information Science,
University of Tokyo, January 2000.
-
"Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness"
(
abstract
) (Summary
©2000 Springer)
( Full Paper ) (Slides)
- Naoki Kobayashi
- Presented as an invited talk
at IFIP TCS2000, August 2000, Sendai. The summary appeared in
Proceedings of TCS2000, Springer LNCS 1872, pp.365-389.
-
"Type Reconstruction for Linear Pi-Calculus with I/O Subtyping"
(
abstract
)
( Full Paper )
(
Preliminary summary in SAS
)
)
- Atsushi Igarashi and Naoki Kobayashi
- Information and Computation, 161, pp.1-44, 2000.
Preliminary summary appeared
as "Type-based analysis of communication for concurrent programming
languages" in Proceedings of International Static Analysis
Symposium (SAS'97), Springer LNCS 1302, pp.187-201
"Linearity and the Pi-Calculus"
(abstract)
(Full paper)
(Summary in POPL'96)
- Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner
- ACM Transactions on Programming Languages
and Systems, 21(5), pp.914-947, 1999. (Preliminary summary appeared in
Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles
of Programming Languages (POPL'96), pp.358-371, 1996)
"Type-Based Useless Variable Elimination"
(abstract)
(summary in PEPM'00)
(full paper)
- Naoki Kobayashi
- A summary appeared in Proceedings of ACM SIGPLAN Workshop on
Partial Evaluation and Semantics-Based Program Manipulation
(PEPM'00), pp.84-93, 2000.
The full paper will appear in Higher-Order and Symbolic Computation.
"Quasi-Linear Types"
(abstract)
(summary in POPL'99)
(full version)
- Naoki Kobayashi
- A revised version of the paper published as
a technical report TR98-02, Department of Information Science,
University of Tokyo, September 1998.
A summary appeared in the Proceedings of ACM POPL'99, pp.29-42.
"Distributed Concurrent Linear Logic Programming"
( abstract
)( full version )
- Naoki Kobayashi, Toshihiro Shimizu, and Akinori Yonezawa
- Theoretical Computer Science, vol.227, pp.185-220, 1999.
"A Generalized Deadlock-Free Process Calculus"
( abstract
)(full version is available from
here )
- Eijiro Sumii and Naoki Kobayashi
- Summary will appear in Proceedings of Workshop on High-Level Concurrent
Language (HLCL'98),
ENTCS, Vol.16, No.3.
Full version will appear as a technical report from
Department of Information Science, University of Tokyo
"A Partially Deadlock-Free Typed Process Calculus"
( abstract
)( postscript )
- Naoki Kobayashi
- ACM Transactions on Programming Languages and Systems, Vol. 20, No. 2, pp.436-482, 1998.
A preliminary summary appeared in the Proceedings of Twelfth IEEE
Symposium on
Logic in Computer Science (LICS'97), pp128-139.
"Towards Foundations of Concurrent
Object-Oriented Programming -- Types and Language Design"
(abstract)
- Naoki Kobayashi and Akinori Yonezawa
- Theory and Practice of Object Systems, John Wiley & Sons,
1(4), 1995 (Preliminary summary appeared in Proceedings of
ACM OOPSLA94, pp.31-45
as "Type-Theoretic Foundations for Concurrent Object-Oriented
Programming")
"Static Analysis of Communication for Asynchronous Concurrent Programming Languages"
(abstract)
(postscript file)
- Naoki Kobayashi, Motoki Nakade, and Akinori Yonezawa
- Second International Static Analysis Symposium (SAS'95),
LNCS 983, pp.225-242, 1995.
"Asynchronous Communication Model Based on Linear Logic"
(abstract)
- Naoki Kobayashi and Akinori Yonezawa
- Journal of Formal Aspects of Computing, Vol.7, No.2,
pp.113-149, Springer-Verlag, 1995
"Higher-Order Concurrent Linear Logic Programming"
(abstract)
- Naoki Kobayashi and Akinori Yonezawa
- Theory and Practice of Parallel Programming, LNCS 907, pp.137-166,
Springer Verlag, 1995.
"PARCS: An MPP-Oriented CLP language"
- K. Konno, M. Nagatsuka, N. Kobayashi, S. Matsuoka, and A. Yonezawa
- Proceedings of the First
International Symposium on Parallel Symbolic Computation (PASCO'94),
pp.254-263, World Scientific, September 1994.
"ACL - A Concurrent Linear Logic Programming Paradigm"
- Naoki Kobayashi and Akinori Yonezawa
- Logic Programming: Proceedings of the 1993 International
Symposium, pp.279-294, MIT Press, 1993.
Back to the Home Page