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

M. Boreale and M. Buscemi, A Framework for the Analysis of Security Protocols*, Lecture Notes in Computer Science, p.2421, 2002.
DOI : 10.1007/3-540-45694-5_32

F. Crazzolara and G. Winskel, Events in security protocols, Proceedings of the 8th ACM Conference on Computer and Communications Security, pp.96-105, 2001.

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

M. Nielsen, C. Palamidessi, and F. Valencia, Temporal concurrent constraint programming: Denotation, logic and applications Nominal logic: A first order theory of names and binding, Pit01] A. Pitts Proc. of TACS, pp.145-188, 2001.

C. Palamidessi, V. Saraswat, B. Victor, and F. Valencia, On the expressiveness of recursion vs replication in the asynchronous pi-calculus, 2006.

F. Rossi and U. Montanari, Concurrent semantics for concurrent constraint programming, Constraint Programming: Proc. 1993 NATO ASI, pp.181-220, 1994.

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

G. Smolka, The Oz programming model, LNCS, vol.1000, pp.324-343, 1995.

V. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-352, 1991.
DOI : 10.1145/99583.99627

F. Valencia, Decidability of infinite-state timed CCP processes and first-order LTL, Theoretical Computer Science, vol.330, issue.3, pp.577-607, 2005.
DOI : 10.1016/j.tcs.2004.10.009