On the symbolic reduction of processes with cryptographic functions, TCS: Theoretical Computer Science, vol.290, 2003. ,
URL : https://hal.archives-ouvertes.fr/inria-00072478
A Framework for the Analysis of Security Protocols*, Lecture Notes in Computer Science, p.2421, 2002. ,
DOI : 10.1007/3-540-45694-5_32
Events in security protocols, Proceedings of the 8th ACM Conference on Computer and Communications Security, pp.96-105, 2001. ,
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
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. ,
On the expressiveness of recursion vs replication in the asynchronous pi-calculus, 2006. ,
Concurrent semantics for concurrent constraint programming, Constraint Programming: Proc. 1993 NATO ASI, pp.181-220, 1994. ,
Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1993. ,
DOI : 10.1145/96709.96733
The Oz programming model, LNCS, vol.1000, pp.324-343, 1995. ,
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
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