On the expressiveness of linearity vs persistence in the asychronous pi-calculus

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 59-68

  Palamidessi, Catuscia ^a   Saraswat, Vijay ^b   Valencia, Frank D ^a   Victor, Björn ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CCP; MINSKY MACHINES; NATURAL SOURCE; PI-CALCULUS;

COMPUTER SCIENCE; CONSTRAINT THEORY; ENCODING (SYMBOLS); SECURITY OF DATA;

LINEAR PROGRAMMING;

EID: 34547257087     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.39     Document Type: Conference Paper

References (24)

1. R. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science, 290, 2003.
2. E. Best, F. de Boer, and C. Palamidessi. Partial order and sos semantics for linear constraint programs. In Proc. of Coordination'97, volume 1282 of LNCS, 1997.
3. B. Blanchet. From linear to classical logic by abstract interpretation. Information Processing Letters, 95(5), 2005.
4. M. Boreale and M. Buscemi. A framework for the analysis of security protocols. In Proc. CONCUR'02, volume 2421 of LNCS, 2002.
5. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1997.
6. N. Busi, M. Gabbrielli, and G. Zavattaro. Comparing recursion, replication and iteration in process calculi. In Proc. ICALP'04, volume 3142 of LNCS, 2004.
7. F. Crazzolara and G. Winskel. Events in security protocols. In Proc. CCS 2001. ACM Press, 2001.
8. F. Fages, P. Ruet, and S. Soliman. Linear concurrent constraint programming: operational and phase semantics. Information and Computation, 2001.
9. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proc. CSFW-14. IEEE, 2001.
10. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 151(2):437-486, 1995.
11. P. Lincoln and V Saraswat. Proofs as concurrent processes: A logical interpretation of concurrent constraint programming. Technical report, Xerox PARC, 1991.
12. N. P. Mendler, P. Panangaden, P. J. Scott, and R. A. G. Seely. A logical view of concurrent constraint programming. Nordic J. of Computing, 2(2):181-220, 1995.
13. D. Miller. The pi-calculus as a theory in linear-logic. In Proc. of Workshop on Extensions to Logic Programming, volume 660 of LNCS, 1992.
14. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part I + II. Information and Computation, 100(1):1-77, 1992.
16. M. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
17. U. Nestmann. What is a 'good' encoding of guarded choice? Information and Computation, 156:287-319, 2000.
18. C. Palamidessi, V Saraswat, F. Valencia, and B. Victor. On the expressiveness of linearity and persistence in the asynchronous π-calculus. Technical report, LIX, Ecole Polytechnique, 2006. http://www.lix.polytechnique. fr/~fvalenci.
19. P. Quaglia and D. Walker. On encoding pπ in mπ. In Proc. FSTTCS'98, volume 1530 of LNCS, 1998.
20. D. Sangiorgi. The name discipline of uniform receptiveness. Theoretical Computer Science, 221(1-2):457-493, 1999.
21. D. Sangiorgi and D. Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
22. V. Saraswat. Concurrent Constraint Programming. The MIT Press, Cambridge, MA, 1993.
23. V. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Technical report, Xerox PARC, 1992.
24. N. Yoshida. Graph types for monadic mobile processes. In Proc. FSTTCS'96, volume 1180 of LNCS, 1996.