A generic type system for the Pi-calculus

Theoretical Computer Science

Volumn 311, Issue 1-3, 2004, Pages 121-163

  Igarashi, Atsushi ^a   Kobayashi, Naoki ^b  

^a KYOTO UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; INPUT OUTPUT PROGRAMS; LARGE SCALE SYSTEMS; THEOREM PROVING;

CONCURRENT PROGRAMS;

COMPUTER PROGRAM LISTINGS;

EID: 0346969701     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00325-6     Document Type: Article

References (53)

1. Amadio R.M., Cardelli L. Subtyping recursive types. ACM Trans. Programming Languages Systems. 15(4):1993;575-631.
2. L. Cardelli, A.D. Gordon, Anytime, anywhere: modal logics for mobile ambients, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2000, pp. 365-377.
3. S. Chaki, S. Rajamani, J. Rehof, Types as models: model checking message-passing programs, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2002, pp. 45-57.
4. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1977, pp. 238-252.
5. S. Conchon, F. Pottier, JOIN(X): constraint-based type inference for the join-calculus, in: Proc. 10th European Symp. on Programming (ESOP'01), Lecture Notes in Computer Science, Vol. 2028, Springer, Berlin, 2001, pp. 221-236.
6. R. DeLine, M. Fähndrich, Enforcing high-level protocols in low-level software, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2001, pp. 59-69.
7. R. DeLine, M. Fähndrich, Adoption and focus: practical linear types for imperative programming, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2002.
8. M. Fähndrich, A. Aiken, Program analysis using mixed term and set constraints, in: Proc. SAS'97, Lecture Notes in Computer Science, Vol. 1302, Springer, Berlin, 1997, pp. 114-126.
9. J. Feret, Occurrence counting analysis for the pi-calculus, in: Electronic Notes in Theoretical Computer Science, Vol. 39, Elsevier, Amsterdam, 2001, pp. 55-77.
10. C. Flanagan, M. Abadi, Object types against races, in: CONCUR'99, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 288-303.
11. C. Flanagan, M. Abadi, Types for safe locking, in: Proc. ESOP 1999, Lecture Notes in Computer Science, Vol. 1576, Springer, Berlin, 1999, pp. 91-108.
12. C. Flanagan, S.N. Freund, Type-based race detection for Java, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2000, pp. 219-232.
13. J.S. Foster, T. Terauchi, A. Aiken, Flow-sensitive type qualifiers, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2002.
14. C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1996, pp. 372-385.
15. Freund S.N., Mitchell J.C. The type system for object initialization in the Java bytecode language. ACM Trans. Programming Languages Systems. 21(6):1999;1196-1250.
16. S.J. Gay, A sort inference algorithm for the polyadic π -calculus, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1993, pp. 429-438.
17. Gordon A.D., Jeffrey A. Typing correspondence assertions for communication protocols. Theoret. Comput. Sci. 300:2003;379-409.
18. A.D. Gordon, A. Jeffrey, Authenticity by typing for security protocols, in: Proc. 14th IEEE Computer Security Foundations Workshop (CSFW 2001), IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 145-159.
19. M. Hennessy, J. Riely, Information flow vs. resource access in the information asynchronous pi-calculus, in: Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, July 2000.
20. K. Honda, Composing processes, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1996, pp. 344-357.
21. K. Honda, A theory of types for π -calculus, Typescript, November 1998, available at http://www.dcs.qmul.ac.uk/̃kohei/.
22. K. Honda, V. Vasconcelos, N. Yoshida, Secure information flow as typed process behaviour, in: Proc. European Symp. on Programming (ESOP) 2000, Lecture Notes in Computer Science, Vol. 1782, Springer, Berlin, 2000, pp. 180-199.
23. K. Honda, N. Yoshida, A uniform type structure for secure information flow, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2002, pp. 81-92.
24. Igarashi A., Kobayashi N. Type reconstruction for linear pi-calculus with I/O subtyping. Inform. Comput. 161:2000;1-44.
25. A. Igarashi, N. Kobayashi, Resource usage analysis, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2002, pp. 331-342.
26. C.B. Jones, A pi-calculus semantics for an object-based design notation, in: Proc. CONCUR'93, Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 158-172.
27. Kobayashi N. A partially deadlock-free typed process calculus. ACM Trans. Programming Languages Systems. 20(2):1998;436-482.
28. Kobayashi N. A type system for lock-free processes. Inform. Comput. 177:2002;122-159.
29. N. Kobayashi, Time regions and effects for resource usage analysis, in: Proc. ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI'03), 2003, pp. 50-61.
30. Kobayashi N., Pierce B.C., Turner D.N. Linearity and the pi-calculus. ACM Trans. Programming Languages Systems. 21(5):1999;914-947.
31. N. Kobayashi, S. Saito, E. Sumii, An implicitly-typed deadlock-free process calculus, in: Proc. CONCUR2000, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, August 2000, pp. 489-503.
32. Kobayashi N., Yonezawa A. Towards foundations for concurrent object-oriented programming - types and language design. Theory Practice Object Systems. 1(4):1995;243-268.
33. B. König, Generating type systems for process graphs, in: Proc. CONCUR'99, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 352-367.
34. B. König, Analysing input/output-capabilities of mobile processes with a generic type system, in: Proc. ICALP2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000.
35. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
36. Milner R. The polyadic. π -calculus: a tutorial Bauer F.L., Brauer W., Schwichtenberg H. Logic and Algebra of Specification. 1993;Springer, Berlin.
37. Milner R. Calculi for interaction. Acta Inform. 33(8):1996;707-737.
38. H.R. Nielson, F. Nielson, Higher-order concurrent programs with finite communication topology, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1994, pp. 84-97.
39. F. Pessaux, X. Leroy, Type-based analysis of uncaught exceptions, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1999, pp. 276-290.
40. Pierce B., Sangiorgi D. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6(5):1996;409-454.
41. Pierce B., Sangiorgi D. Behavioral equivalence in the polymorphic pi-calculus. J. Assoc. Comput. Mach. 47(5):2000;531-584.
42. B.C. Pierce, D.N. Turner, Concurrent objects in a process calculus, in: Theory and Practice of Parallel Programming (TPPP), Sendai, Japan (November 1994), Lecture Notes in Computer Science, Vol. 907, Springer, Berlin, 1995, pp. 187-215.
43. F. Puntigam, C. Peter, Changeable interfaces and promised messages for concurrent components, in: Proc. 1999 ACM Symp. on Applied Computing, 1999, pp. 141-145.
44. A. Ravara, V. Vasconcelos, Typing non-uniform concurrent objects, in: Proc. CONCUR2000, Lecture Notes in Computer Science, Vol. 1877, 2000, pp. 474-488.
45. C. Stirling, Modal and temporal logics for processes, in: Logics for Concurrency, Lecture Notes in Computer Science, Vol. 1043, 1996, pp. 149-237.
46. E. Sumii, N. Kobayashi, A generalized deadlock-free process calculus, in: Proc. Workshop High-Level Concurrent Language (HLCL'98), ENTCS, Vol. 16, No. 3, 1998, pp. 55-77.
47. Talpin J.-P., Jouvelot P. Polymorphic type, region and effect inference. J. Funct. Programming. 2(3):1992;245-271.
48. Talpin J.-P., Jouvelot P. The type and effect discipline. Inform. Comput. 111(2):1994;245-296.
49. M. Tofte, J.-P. Talpin, Implementation of the call-by-value lambda-calculus using a stack of regions, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1994, pp. 188-201.
50. V.T. Vasconcelos, K. Honda, Principal typing schemes in a polyadic π -calculus, in: CONCUR'93, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993, pp. 524-538.
51. A. Venet, Automatic determination of communication topologies in mobile systems, in: Proc. 5th Internat. Symp. on Static Analysis (SAS '98), Lecture Notes in Computer Science, Vol. 1503, Springer, Berlin, 1998, pp. 152-167.
52. N. Yoshida, Graph types for monadic mobile processes, in: FST/TCS'16, Lecture Notes in Computer Science, Vol. 1180, Springer, Berlin, 1996, pp. 371-387.
53. N. Yoshida, M. Berger, K. Honda, Strong normalization in the π -calculus, in: Proc. IEEE Symp. on Logic in Computer Science, 2001.