Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1872 LNCS, Issue , 2000, Pages 365-389

  Kobayashi, Naoki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT PROCESS; CONCURRENT PROGRAM; DEADLOCK FREEDOM; FAIR SCHEDULING; LIVELOCK FREEDOM; REQUEST MESSAGES; SERVER PROCESS; WHOLE PROCESS;

CALCULATIONS;

EID: 84879077361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_27     Document Type: Conference Paper

References (26)

1. G. Boudol. Typing the use of resources in a concurrent calculus. In Proceedings of ASIAN'97, pages 239-253, 1997.
2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of xpoints. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 238-252, 1977.
3. K. Crary and S. Weirich. Resource bound certification. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 184-198, 2000.
4. C. Flanagan and M. Abadi. Object types against races. In CONCUR'99, LNCS 1664, pages 288-303. Springer-Verlag, 1999.
5. S. J. Gay. A sort inference algorithm for the polyadic calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 429-438, 1993.
6. M. Hofmann. Linear types and non-size-increasing polynomial time computation. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 464-473, 1999.
7. N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436-482, 1998. A preliminary summary appeared in Proceedings of LICS'97, pages 128-139.
8. N. Kobayashi. Quasi-linear types. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 29-42, 1999.
9. N. Kobayashi. A livelock-free typed process calculus. Technical report, Dept. Info. Sci., Univ. of Tokyo, 2000. To appear. Available at http://www.yl.is.s.utokyo. ac.jp/koba/publications.html.
10. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems, 21(5):914-947, 1999. Preliminary summary appeared in Proceedings of POPL'96, pp.358-371.
11. N. Kobayashi, S. Saito, and E. Sumii. An implicitly-typed deadlock-free process calculus. Technical Report TR00-01, Dept. Info. Sci., Univ. of Tokyo, January 2000. Available at http://www.yl.is.s.u-tokyo.ac.jp/koba/publications. html. A summary will appear in Proceedings of CONCUR 2000, LNCS, Springer-Verlag.
12. N. Kobayashi and A. Yonezawa. Towards foundations for concurrent objectoriented programming-types and language design. Theory and Practice of Object Systems, 1(4):243-268, 1995.
13. R. Milner. The polyadic calculus: A tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.
14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I, II. Information and Computation, 100:1-77, September 1992.
15. U. Nestmann. What is a good' encoding of guarded choice? In EXPRESS'97, volume 7 of ENTCS. Elsevier Science Publishers, September 1997.
16. S. Peyton Jones. Concurrent Haskell. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 295-308, 1996.
17. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996.
18. B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming (TPPP), Sendai, Japan (Nov. 1994), LNCS 907, pages 187-215. Springer-Verlag, 1995.
19. F. Puntigam. Coordination requirements expressed in types for active objects. In Proceedings of ECOOP'97, LNCS 1241, pages 367-388, 1997.
20. F. Puntigam and C. Peter. Changeable interfaces and promised messages for concurrent components. In Proceedings of the 1999 ACM Symposium on Applied Computing, pages 141-145, 1999.
21. J. H. Reppy. CML: A higher-order concurrent language. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 293-305, 1991.
22. D. Sangiorgi. The name discipline of uniform receptiveness (extended abstract). In Proceedings of ICALP'97, LNCS 1256, pages 303-313, 1997.
23. E. Sumii and N. Kobayashi. A generalized deadlock-free process calculus. In Proc. of Workshop on High-Level Concurrent Language (HLCL'98), volume 16(3) of ENTCS, pages 55-77, 1998.
24. V. T. Vasconcelos and K. Honda. Principal typing schemes in a polyadic calculus. In CONCUR'93, LNCS 715, pages 524-538. Springer-Verlag, 1993.
25. A. Yonezawa and M. Tokoro. Object-Oriented Concurrent Programming. The MIT Press, 1987.
26. N. Yoshida. Graph types for monadic mobile processes. In FST/TCS'16, LNCS 1180, pages 371-387. Springer-Verlag, 1996.