Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.367, issue.1-2, pp.2-32, 2006. ,
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00099982
Mobile values, new names, and secure communication, Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'01, pp.104-115, 2001. ,
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, Computer Aided Verification, 17th International Conference, CAV 2005, pp.281-285, 2005. ,
DOI : 10.1007/11513988_27
URL : https://hal.archives-ouvertes.fr/inria-00000408
Term rewriting and all that, 1998. ,
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, Journal of Symbolic Computation, vol.21, issue.2, pp.211-243, 1996. ,
DOI : 10.1006/jsco.1996.0009
Deciding the Word Problem in the Union of Equational Theories, Information and Computation, vol.178, issue.2, pp.346-390, 2002. ,
DOI : 10.1006/inco.2001.3118
YAPA, ACM Transactions on Computational Logic, vol.14, issue.1, p.4, 2013. ,
DOI : 10.1145/2422085.2422089
URL : https://hal.archives-ouvertes.fr/inria-00426624
An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.11-13, 2001. ,
DOI : 10.1109/CSFW.2001.930138
Automated verification of equivalence properties of cryptographic protocols, ACM Trans. Comput. Log. Available as Research Report, vol.172332, issue.4, pp.1-23, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00732905
Hierarchical combination of intruder theories, Information and Computation, vol.206, issue.2-4, pp.352-377, 2008. ,
DOI : 10.1016/j.ic.2007.07.004
URL : https://hal.archives-ouvertes.fr/inria-00329715
Easy Intruder Deductions, Lecture Notes in Computer Science, vol.2772, pp.225-242, 2003. ,
DOI : 10.1007/978-3-540-39910-0_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3113
FAST: an efficient decision procedure for deduction and static equivalence, Proceedings of RTA 2011 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.11-20, 2011. ,
DOI : 10.1007/978-3-642-19751-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.4644
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols, Journal of Automated Reasoning, vol.8, issue.1/2, pp.441-487, 2010. ,
DOI : 10.1016/S0747-7171(89)80022-7
URL : https://hal.archives-ouvertes.fr/inria-00525778
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols, Computer Aided Verification, 20th International Conference Proceedings, pp.414-418, 2008. ,
DOI : 10.1007/978-3-540-70545-1_38
Computing knowledge in security protocols under convergent equational theories, J. Autom. Reasoning, vol.48, issue.2, pp.219-262, 2012. ,
On the security of public key protocols (extended abstract), 22nd Annual Symposium on Foundations of Computer Science, pp.350-357, 1981. ,
Combination techniques for non-disjoint equational theories, 12th International Conference on Automated Deduction Proceedings, pp.267-281, 1994. ,
DOI : 10.1007/3-540-58156-1_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.8167
Hierarchical Combination, Automated Deduction -CADE-24 -24th International Conference on Automated Deduction, Lake Placid Proceedings, volume 7898 of Lecture Notes in Computer Science, pp.249-266, 2013. ,
DOI : 10.1007/978-3-642-38574-2_17
URL : https://hal.archives-ouvertes.fr/hal-00878649
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties, Foundations of Security Analysis and Design V, pp.1-50, 2007. ,
DOI : 10.1007/s10990-007-9000-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.3197
Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.166-175, 2001. ,
DOI : 10.1145/501983.502007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3643
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols, Foundations of Security Analysis and Design V, pp.166-194, 2007. ,
DOI : 10.1007/11805618_21
The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, p.85128, 1998. ,
DOI : 10.3233/JCS-1998-61-205
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties, 2012 IEEE 25th Computer Security Foundations Symposium, pp.78-94, 2012. ,
DOI : 10.1109/CSF.2012.25
Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation, vol.8, issue.1-2, pp.51-99, 1989. ,
DOI : 10.1016/S0747-7171(89)80022-7
A proof theoretic analysis of intruder theories, Logical Methods in Computer Science, vol.6, issue.3, 2010. ,
The CL-Atse Protocol Analyser, Term Rewriting and Applications, 17th International Conference Proceedings, pp.277-286, 2006. ,
DOI : 10.1007/11805618_21
URL : https://hal.archives-ouvertes.fr/inria-00103573