Type abstractions of name-passing processes

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

Volumn 4767 LNCS, Issue , 2007, Pages 302-317

  Acciai, Lucia ^a   Boreale, Michele ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; SECURITY OF DATA;

BPP PROCESSES; JOIN CALCULUS; SIMULATION RELATION;

PROGRAM PROCESSORS;

EID: 38149039251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75698-9_20     Document Type: Conference Paper

References (28)

1. Milner, R.: The polyadic μ-calculus: a tutorial, In: Logic and Algebra of Specification, pp. 203-246. Springer, Heidelberg (1993)
2. Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join calculus. In: POPL, pp. 372-385. ACM Press, New York (1996)
3. Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. TCS 311(1-3), 121-163 (2004)
4. Christensen, S., Hirshfeld, Y., Moller, F.: Decidable subsets of CCS. The Computer Journal 37(4), 233-242 (1994)
5. Christensen, S., Hishfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 143-157. Springer, Heidelberg (1993)
6. Hirshfeld, Y., Moller, F.: Decidability results in automata and process theory. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 102-148. Springer, Heidelberg (1996)
7. Burkart, O., Esparza, J.: More infinite results. In: Current Trends in Theoretical Computer Science: entering the 21st centuary, pp. 480-503. World Scientific Publishing Co., Inc., Singapore (2001)
8. Sangiorgi, D.: The name discipline of uniform receptiveness. TCS 221(1-2), 457-493 (1999)
9. Stirling, C.: Modal logics for communicating systems. TCS 49(2-3), 311-347 (1987)
10. Rajamani, S.K., Rehof, J.: A behavioral module system for the pi-calculus. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 375-394. Springer, Heidelberg (2001)
11. Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: Model checking message-passing programs. In: POPL, pp. 45-57. ACM Press, New York (2002)
12. Sangiorgi, D.: A theory of bisimulation for μ-calculus. Acta Informartica 33 (1996)
13. Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems 21(5), 914-947 (1999)
14. Kobayashi, N.: A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems 20(2), 436-482 (1998)
15. Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 489-503. Springer, Heidelberg (2000)
16. Kobayashi, N.: A type system for lock-free processes. Information and Computation 177(2), 122-159 (2002)
17. Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informartica 42(4-5), 291-347 (2005)
18. Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233-247. Springer, Heidelberg (2006)
19. Kobayashi, N., Suenaga, K., Wischik, L.: Resource usage analysis for the pi-calculus. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 298-312. Springer, Heidelberg (2005)
20. Fournet, C., Laneve, C., Maranget, L., Rémy, D.: Implicit typing àla ML for the joincalculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 196-212. Springer, Heidelberg (1997)
21. Odersky, M., Zenger, C., Zenger, M., Chen, G.: A functional view of join. Technical Report ACRC-99-016, University of South Australia (1999)
22. Asperti, A., Busi, N.: Mobile petri nets. Technical Report UBLCS 96-10, Università di Bologna (1996)
23. Odersky, M.: Functional nets. In: Smolka, G. (ed.) ESOP 2000 and ETAPS 2000. LNCS, vol. 1782, pp. 1-25. Springer, Heidelberg (2000)
24. Buscemi, M.G., Sassone, V.: High-level petri nets as type theories in the join calculus. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol. 2030, pp. 104-120. Springer, Heidelberg (2001)
25. Najm, E., Nimour, A.: Explicit behavioral typing for object interfaces, In: Moreira, A.M.D., Demeyer, S. (eds.) Object-Oriented Technology. ECOOP 1999 Workshop Reader. LNCS, vol. 1743, p. 321. Springer, Heidelberg (1999)
26. Najm, E., Nimour, A., Stefani, J.B.: Infinite types for distributed object interfaces. In: FMOODS of IFIP Conference Proceedings, vol. 139, p. 450 (1999)
27. Ravara, A., Vasconcelos, V.T.: Behavioral types for a calculus of concurrent objects. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 554-561. Springer, Heidelberg (1997)
28. Yoshida, N.: Graph types for monadic mobile processes. In: Chandra, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1180, pp. 371-386. Springer, Heidelberg (1996)