Mobile values, new names, and secure communication, Proceedings of POPL 2001, pp.104-115, 2001. ,
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
A Calculus for Cryptographic Protocols: The Spi Calculus, Information and Computation, vol.148, issue.1, pp.1-70, 1999. ,
DOI : 10.1006/inco.1998.2740
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes, Proceedings of ICALP 2008, pp.99-111, 2008. ,
DOI : 10.1007/978-3-540-70583-3_9
Proof Techniques for Cryptographic Processes, SIAM Journal on Computing, vol.31, issue.3, pp.947-986, 2001. ,
DOI : 10.1137/S0097539700377864
Observational mu-calculus, BRICS, 1999. ,
A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984. ,
DOI : 10.1145/828.833
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements, Proceedings of ESOP 2007, pp.18-32, 2007. ,
DOI : 10.1007/978-3-540-71316-6_3
A linear translation from CTL* to the first-order modal ?? -calculus, Theoretical Computer Science, vol.412, issue.28, pp.3129-3139, 2011. ,
DOI : 10.1016/j.tcs.2011.02.034
Model Checking Mobile Processes, Information and Computation, vol.129, issue.1, pp.35-51, 1996. ,
DOI : 10.1006/inco.1996.0072
URL : https://doi.org/10.1006/inco.1996.0072
Multiple-labelled transition systems for nominal calculi and their logics, Mathematical Structures in Computer Science, vol.18, issue.1, pp.107-143, 2008. ,
A congruence rule format for name-passing process calculi, Information and Computation, vol.207, issue.2, pp.209-236, 2009. ,
DOI : 10.1016/j.ic.2007.12.005
On observing nondeterminism and concurrency, Proceedings of ICALP, pp.299-309, 1980. ,
DOI : 10.1007/3-540-10003-2_79
Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985. ,
DOI : 10.1145/2455.2460
URL : https://www.scss.tcd.ie/Matthew.Hennessy/pubs/old/HMjacm85.pdf
A logical characterisation of static equivalence, Proceedings of MFPS XXIII, pp.139-157, 2007. ,
Weak Equivalences in Psi-Calculi, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.322-331, 2010. ,
DOI : 10.1109/LICS.2010.30
First-order reasoning for higher-order concurrency, Computer Languages, Systems & Structures, vol.38, issue.3, pp.242-277, 2012. ,
DOI : 10.1016/j.cl.2012.04.003
Results on the propositional ??-calculus, Theoretical Computer Science, vol.27, issue.3, pp.333-354, 1983. ,
DOI : 10.1016/0304-3975(82)90125-6
What good is temporal logic?, IFIP Congress, pp.657-668, 1983. ,
A Calculus of Communicating Systems, LNCS, vol.92, 1980. ,
DOI : 10.1007/3-540-10235-3
A modal characterisation of observable machine-behaviour, Proceedings of CAAP 1981, pp.25-34, 1981. ,
DOI : 10.1007/3-540-10828-9_52
Modal logics for mobile processes, Theoretical Computer Science, vol.114, issue.1, pp.149-171, 1993. ,
DOI : 10.1016/0304-3975(93)90156-N
URL : https://doi.org/10.1016/0304-3975(93)90156-n
Modal logics for nominal transition systems, Proceedings of CONCUR 2015 Schloss Dagstuhl -Leibniz- Zentrum für Informatik, pp.198-211, 2015. ,
Nominal Sets, 2013. ,
DOI : 10.1017/CBO9781139084673
Modal logics for nominal transition systems. Archive of Formal Proofs, 2016. ,
Explicit fusions, Theoretical Computer Science, vol.340, issue.3, pp.606-630, 2005. ,
DOI : 10.1016/j.tcs.2005.03.017
URL : https://doi.org/10.1016/j.tcs.2005.03.017
A logical characterization for linear higher-order processes, Journal of Shanghai Jiaotong University (Science), vol.322, issue.3, pp.185-194, 2015. ,
DOI : 10.1016/j.tcs.2003.10.041