F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

S. Barker and M. Fernandez, Term Rewriting for Access Control, Proceedings of the 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'2006), 2006.
DOI : 10.1145/984334.984339

L. Bauer, J. Ligatti, and D. Walker, Composing security policies with polymer, PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pp.305-314, 2005.

E. D. Bell and L. J. Lapadula, .secure computer systems: Mathematical foundations, Mitre Corporation, 1974.

M. Bishop, Introduction to Computer Security, 2004.

H. Cirstea, Specifying Authentication Protocols Using Rewriting and Strategies, PADL, pp.138-152, 1990.
DOI : 10.1007/3-540-45241-9_10
URL : https://hal.archives-ouvertes.fr/inria-00100509

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., Maude: specification and programming in rewriting logic, Theoretical Computer Science, vol.285, issue.2, pp.187-243, 2002.
DOI : 10.1016/S0304-3975(01)00359-0

S. D. Di-vimercati, P. Samarati, and S. Jajodia, Policies, Models, and Languages for Access Control, Lecture Notes in Computer Science, vol.3433, pp.225-237, 2005.
DOI : 10.1007/978-3-540-31970-2_18

R. Echahed and F. Prost, Security policy in a declarative style, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.153-163, 2005.
DOI : 10.1145/1069774.1069789

J. A. Goguen and J. Meseguer, Security Policies and Security Models, 1982 IEEE Symposium on Security and Privacy, pp.11-20, 1982.
DOI : 10.1109/SP.1982.10014

B. Gramlich, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Theoretical Computer Science, vol.165, issue.1, pp.97-131, 1996.
DOI : 10.1016/0304-3975(96)00042-4

S. Jajodia, P. Samarati, M. L. Sapino, and V. S. Subrahmanian, Flexible support for multiple access control policies, ACM Transactions on Database Systems, vol.26, issue.2, pp.214-260, 2001.
DOI : 10.1145/383891.383894

A. Middeldorp, A sufficient condition for the termination of the direct sum of term rewriting systems, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.396-401, 1989.
DOI : 10.1109/LICS.1989.39194

A. Middeldorp and Y. Toyama, Completeness of combinations of constructor systems, Lecture Notes in Computer Science, vol.488, pp.188-199, 1991.
DOI : 10.1007/3-540-53904-2_96

T. Moses, Extensible access control markup language (xacml) version 2.0, OASIS, 2005.

J. A. Pavlich-mariscal, L. Michel, and S. A. Demurjian, A Formal Enforcement Framework for Role-Based Access Control Using Aspect-Oriented Programming, MoDELS, pp.537-552, 2005.
DOI : 10.1007/11557432_41

M. Rusinowitch, On termination of the direct sum of term-rewriting systems, Information Processing Letters, vol.26, issue.2, pp.65-70, 1987.
DOI : 10.1016/0020-0190(87)90039-1
URL : https://hal.archives-ouvertes.fr/inria-00075874

M. Rusinowitch, S. Stratulat, and F. Klay, Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm, J. Autom. Reasoning, vol.30, pp.53-177, 2003.
DOI : 10.1007/10722167_27
URL : https://hal.archives-ouvertes.fr/inria-00099167

F. B. Schneider, Enforceable security policies, Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems], pp.30-50, 2000.
DOI : 10.1109/FITS.2003.1264930
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1853

Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Information Processing Letters, vol.25, issue.3, pp.141-143, 1986.
DOI : 10.1016/0020-0190(87)90122-0

Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, Journal of the ACM, vol.34, issue.1, pp.128-143, 1987.
DOI : 10.1145/7531.7534