R. Amadio, D. Lugiez, and V. Vanackere, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, vol.290, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072478

E. Best, F. De-boer, and C. Palamidessi, Partial order and SOS semantics for linear constraint programs, Proc. of Coordination'97, 1997.
DOI : 10.1007/3-540-63383-9_85
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.9250

B. Blanchet, From linear to classical logic by abstract interpretation, Information Processing Letters, vol.95, issue.5, 2005.

M. Boreale and M. Buscemi, A Framework for the Analysis of Security Protocols*, Proc. CONCUR'02, 2002.
DOI : 10.1007/3-540-45694-5_32

E. Börger, E. Grädel, and Y. Gurevich, The Classical Decision Problem, 1997.
DOI : 10.1007/978-3-642-59207-2

N. Busi, M. Gabbrielli, and G. Zavattaro, Comparing Recursion, Replication, and Iteration in Process Calculi, Proc. ICALP'04, 2004.
DOI : 10.1007/978-3-540-27836-8_28

F. Crazzolara and G. Winskel, Events in security protocols, Proc. CCS, 2001.

F. Fages, P. Ruet, and S. Soliman, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, 2001.
DOI : 10.1006/inco.2000.3002
URL : https://hal.archives-ouvertes.fr/hal-01431358

M. Fiore and M. Abadi, Computing symbolic models for verifying cryptographic protocols, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., 2001.
DOI : 10.1109/CSFW.2001.930144

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9756

P. Lincoln and V. Saraswat, Proofs as concurrent processes: A logical interpretation of concurrent constraint programming, 1991.

N. P. Mendler, P. Panangaden, P. J. Scott, and R. A. Seely, A logical view of concurrent constraint programming, Nordic J. of Computing, vol.2, issue.2, pp.181-220, 1995.

D. Miller, The pi-calculus as a theory in linear-logic, Proc. of Workshop on Extensions to Logic Programming, 1992.

R. Milner, Communicating and Mobile Systems: the ?calculus, 1999.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, Part I + II. Information and Computation, pp.1-77, 1992.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

U. Nestmann, What is a 'good' encoding of guarded choice? Information and Computation, pp.287-319, 2000.

C. Palamidessi, V. Saraswat, F. Valencia, B. Victor, L. et al., On the expressiveness of linearity and persistence in the asynchronous ?-calculus, 2006.

P. Quaglia and D. Walker, On encoding p?? in m??, Proc. FSTTCS'98, 1998.
DOI : 10.1007/978-3-540-49382-2_5

D. Sangiorgi, The name discipline of uniform receptiveness, Theoretical Computer Science, vol.221, issue.1-2, pp.457-493, 1999.
DOI : 10.1016/S0304-3975(99)00040-7

D. Sangiorgi and D. Walker, The ?-calculus: A Theory of Mobile Processes, 2001.

V. Saraswat, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1993.
DOI : 10.1145/96709.96733

V. Saraswat and P. Lincoln, Higher-order linear concurrent constraint programming, 1992.

N. Yoshida, Graph types for monadic mobile processes, Proc. FSTTCS'96, 1996.
DOI : 10.1007/3-540-62034-6_64
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.6921