Mobile Values, New Names, and Secure Communication, pp.104-115, 2001. ,
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.1-70, 1999. ,
DOI : 10.1145/266420.266432
A process-algebraic approach for the analysis of probabilistic noninterference1, Journal of Computer Security, vol.12, issue.2, pp.191-245, 2004. ,
DOI : 10.3233/JCS-2004-12202
Parametric Probabilistic Sensor Network Routing, pp.122-131, 2003. ,
DOI : 10.1145/941365.941368
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements, ESOP 2007, pp.19-32, 2007. ,
DOI : 10.1007/978-3-540-71316-6_3
Towards optimal sleep scheduling in sensor networks for rare-event detection, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005., pp.20-27, 2005. ,
DOI : 10.1109/IPSN.2005.1440887
The concurrency workbench, ACM Trans. Program. Lang. Syst, vol.15, issue.1, pp.36-72, 1993. ,
DOI : 10.1007/3-540-52148-8_3
Deciding Knowledge in Security Protocols under Equational Theories, Theoretical Computer Science, vol.367, issue.12, pp.2-32, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000554
Rewrite Systems. Handbook of Theoretical Computer Science, Formal Models and Sematics (B) B, pp.243-320, 1990. ,
Approximate non-interference, Journal of Computer Security, vol.12, issue.1, pp.37-82, 2004. ,
DOI : 10.3233/JCS-2004-12103
On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.2, pp.198-208, 1983. ,
DOI : 10.1109/TIT.1983.1056650
A randomized protocol for signing contracts, Communications of the ACM, vol.28, issue.6, pp.637-647, 1985. ,
DOI : 10.1145/3812.3818
Initial Algebra Semantics and Continuous Algebras, Journal of the ACM, vol.24, issue.1, pp.68-95, 1977. ,
DOI : 10.1145/321992.321997
The Troublesome Probabilistic Powerdomain, Proc. of Workshop on Computation and Approximation. ENTCS, 1998. ,
DOI : 10.1016/S1571-0661(05)80216-6
Casper: A compiler for the analysis of security protocols, Journal of Computer Security, vol.6, issue.1-2, pp.53-84, 1998. ,
DOI : 10.3233/JCS-1998-61-204
Axioms for Probability and Nondeterminism, Electronic Notes in Theoretical Computer Science, vol.96, pp.7-28, 2003. ,
DOI : 10.1016/j.entcs.2004.04.019
URL : http://doi.org/10.1016/j.entcs.2004.04.019
Communication and Concurrency, 1989. ,
Communicating and Mobile Systems: the ??Calculus, 1999. ,
Foundations for Programming Languages, 1996. ,
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Theoretical Computer Science, vol.353, issue.1-3, pp.1-3, 2006. ,
DOI : 10.1016/j.tcs.2005.10.044
Constraints for free in concurrent computation, LNCS, vol.1023, pp.171-186, 1995. ,
DOI : 10.1007/3-540-60688-2_43
URL : https://hal.archives-ouvertes.fr/inria-00536813
How to Exchange Secrets by Oblivious Transfer, 1981. ,
A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1977. ,
DOI : 10.1145/359340.359342
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
Security properties and CSP, Proceedings 1996 IEEE Symposium on Security and Privacy, 1996. ,
DOI : 10.1109/SECPRI.1996.502680
Modeling and Verification of Randomized Distributed Real-Time Systems, 1995. ,
Probabilistic Simulations for Probabilistic Processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995. ,
The Mobility Workbench -A Tool for the pi-Calculus, CAV 1994, pp.428-440, 1994. ,