Deciding knowledge in security protocols under equational theories, Theor. Comput. Sci, vol.367, issue.1-2, pp.2-32, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000554
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. ,
Unification theory, Handbook of Automated Reasoning, pp.445-532, 2001. ,
An on-the-fly model-checker for security protocol analysis, Computer Security-ESORICS 2003, 8th European Symposium on Research in Computer Security, vol.2808, pp.253-270, 2003. ,
, , 2003.
Modeling and verifying security protocols with the Applied Pi calculus and proverif, Foundations and Trends in Privacy and Security, vol.1, issue.1-2, pp.1-135, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01423760
On forward closure and the finite variant property, Frontiers of Combining Systems-9th International Symposium, vol.8152, pp.327-342, 2013. ,
Computing knowledge in security protocols under convergent equational theories, J. Autom. Reasoning, vol.48, issue.2, pp.219-262, 2012. ,
The finite variant property: How to get rid of some algebraic properties, Rewriting Techniques and Applications, vol.3467, pp.294-307, 2005. ,
Built-in variant generation and unification, and their applications in Maude 2.7, Automated Reasoning-8th International Joint Conference, vol.9706, pp.183-192, 2016. ,
Bounded ACh Unification. CoRR, 2018. ,
Hierarchical combination, 24-24th International Conference on Automated Deduction, vol.7898, pp.249-266, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00878649
Maude-NPA: Cryptographic protocol analysis modulo equational properties, Lecture Notes in Computer Science, vol.5705, pp.1-50, 2007. ,
Folding variant narrowing and optimal variant termination, J. Log. Algebr. Program, vol.81, issue.7-8, pp.898-928, 2012. ,
Completion of a set of rules modulo a set of equations, SIAM J. Comput, vol.15, issue.4, pp.1155-1194, 1986. ,
Solving equations in abstract algebras: A rule-based survey of unification, Computational Logic-Essays in Honor of Alan Robinson, pp.257-321, 1991. ,
Syntactic theories and unification, Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on Logic in Computer Science, pp.270-277, 1990. ,
Automated Deduction-CADE-18, 18th International Conference on Automated Deduction, vol.2392, pp.471-485, 2002. ,
The TAMARIN prover for the symbolic analysis of security protocols, Computer Aided Verification-25th International Conference, CAV 2013, vol.8044, pp.696-701, 1319. ,
Variant-based satisfiability in initial algebras, Sci. Comput. Program, vol.154, pp.3-41, 2018. ,
On the unification problem for cartesian closed categories, Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pp.57-63, 1993. ,
Proof transformations for equational theories, Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on Logic in Computer Science, pp.278-288, 1990. ,
Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation, vol.8, pp.51-99, 1989. ,
Theories of homomorphic encryption, unification, and the finite variant property, Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, pp.123-133, 2014. ,
Unification in combinations of collapse-free regular theories, Journal of Symbolic Computation, vol.3, issue.1-2, pp.153-181, 1987. ,
If (G, ?) is R-normalized, S |= G? and G is not in dag solved form, then there exist some G and a substitution ? ,