. Abadi, A calculus for access control in distributed systems, ACM Transactions on Programming Languages and Systems, vol.15, issue.4, pp.706-734, 1993.
DOI : 10.1145/155183.155225

. Antoniou, Rule-based Policy Specification, Secure Data Management in Decentralized Systems of Advances in Information Security, 2007.
DOI : 10.1007/978-0-387-27696-0_6

. Antoy, A needed narrowing strategy, Journal of the ACM, vol.47, issue.4, pp.776-822, 2000.
DOI : 10.1145/347476.347484

T. Arts and J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science, vol.236, issue.1-2, pp.133-178, 2000.
DOI : 10.1016/S0304-3975(99)00207-8

N. Baader, F. Baader, and T. Nipkow, Term Rewriting and all That, 1998.

S. Baader, F. Baader, and W. Snyder, Unification theory, Handbook of Automated Reasoning, pp.445-532, 2001.

. Tom, Piggybacking rewriting on java, pp.36-47, 2007.

. Balland, Formal Islands, Lecture Notes in Computer Science, vol.4019, pp.51-65, 2006.
DOI : 10.1007/11784180_7

URL : https://hal.archives-ouvertes.fr/inria-00001146

. Balland, Modular formal islands: Embed theory in your practice, Proceedings of the Third Taiwanese-French Conference on Information Technology, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001186

. Balland, E. Moreau-]-balland, and P. Moreau, Optimizing pattern matching compilation by program transformation Electronic Communications of EASST, 3rd Workshop on Software Evolution through Transformations (SeTra'06), 2006.

. Bancilhon, Magic sets and other strange ways to implement logic programs, PODS, pp.1-15, 1986.

F. Barker, S. Barker, and M. Fernández, Term Rewriting for Access Control, Lecture Notes in Computer Science, vol.7, issue.1, pp.179-193, 2006.
DOI : 10.1145/344287.344301

S. Barker and P. J. Stuckey, Flexible access control policy specification with constraint logic programming, ACM Transactions on Information and System Security, vol.6, issue.4, pp.501-546, 2003.
DOI : 10.1145/950191.950194

. Bauer, Efficient Proving for Practical Distributed Access-Control Systems, In [Biskup and Lopez, pp.19-37, 2007.
DOI : 10.1007/978-3-540-74835-9_3

. Bauer, A calculus for composing security policies, 2002.

. Bauer, Composing security policies with polymer, [Sarkar and Hall, pp.305-314, 2005.

N. Becker, M. Y. Becker, and S. Nanz, A logic for state-modifying authorization policies, pp.203-218, 2007.

S. Becker, M. Y. Becker, and P. Sewell, Cassandra: distributed access control policies with tunable expressiveness, Proceedings. Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, 2004. POLICY 2004., pp.159-168, 2004.
DOI : 10.1109/POLICY.2004.1309162

S. Becker, M. Y. Becker, and P. Sewell, Cassandra: flexible trust management, applied to electronic health records, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., pp.139-154, 2004.
DOI : 10.1109/CSFW.2004.1310738

. Bell, . Lapadula, D. E. Bell, and L. J. Lapadula, Secure computer systems: A mathematical model, volume ii, Journal of Computer Security, vol.4, issue.23, pp.229-263, 1996.

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

. Benanav, Complexity of matching problems, Journal of Symbolic Computation, vol.3, issue.1-2, pp.203-216, 1987.
DOI : 10.1016/S0747-7171(87)80027-5

. Bertino, An access control model supporting periodicity constraints and temporal reasoning, ACM Transactions on Database Systems, vol.23, issue.3, pp.231-285, 1998.
DOI : 10.1145/293910.293151

URL : http://mercurio.sm.dsi.unimi.it/~samarati/Papers/tods-temporal.ps

. Bertolissi, Dynamic Event-Based Access Control as Term Rewriting, DBSec, pp.195-210, 2007.
DOI : 10.1109/2.485845

URL : http://www.dcs.kcl.ac.uk/staff/clara/papers/dbsec07-final.pdf

K. Biba, Integrity considerations for secure computer systems, 1977.

G. Birkhoff, On the structure of abstract algebras, Proc. Camb. Philos. Soc, pp.433-454, 1935.

. Biskup, . Lopez, J. Biskup, and J. Lopez, Computer Security -ES- ORICS, 12th European Symposium On Research In Computer Security Proceedings, volume 4734 of Lecture Notes in Computer Science, 2007.

. Boichut, Rewriting Approximations for Fast Prototyping of Static Analyzers, pp.48-62, 2007.
DOI : 10.1007/978-3-540-73449-9_6

URL : https://hal.archives-ouvertes.fr/hal-00463418

. Bonatti, An algebra for composing access control policies, ACM Transactions on Information and System Security, vol.5, issue.1, pp.1-35, 2002.
DOI : 10.1145/504909.504910

. Bonatti, . Olmedilla, P. A. Bonatti, and D. Olmedilla, Driving and Monitoring Provisional Trust Negotiation with Metapolicies, Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'05), pp.14-23, 2005.
DOI : 10.1109/POLICY.2005.13

. Bonatti, . Samarati, P. A. Bonatti, and P. Samarati, A uniform framework for regulating service access and information release on the Web, Journal of Computer Security, vol.10, issue.3, pp.241-272, 2002.
DOI : 10.3233/JCS-2002-10303

. Borovanský, An Overview of ELAN, Electronic Notes in Theoretical Computer Science, vol.15, 1998.
DOI : 10.1016/S1571-0661(05)82552-6

. Borovansky, REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS, International Journal of Foundations of Computer Science, vol.34, issue.01, pp.69-95, 2001.
DOI : 10.1007/BF00248324

A. Bouhoula, SPIKE: A system for sufficient completeness and parameterized inductive proofs, Lecture Notes in Computer Science, vol.814, pp.836-840, 1994.
DOI : 10.1007/3-540-58156-1_71

J. Bouhoula, A. Bouhoula, and F. Jacquemard, Automatic verification of sufficient completeness for conditional constrained term rewriting systems, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070163

. Brewer, . Nash, D. F. Brewer, and M. J. Nash, The Chinese Wall security policy, Proceedings. 1989 IEEE Symposium on Security and Privacy, pp.206-214, 1989.
DOI : 10.1109/SECPRI.1989.36295

. Bruns, A simple and expressive semantic framework for policy composition in access control, Proceedings of the 2007 ACM workshop on Formal methods in security engineering , FMSE '07, pp.12-21, 2007.
DOI : 10.1145/1314436.1314439

. Ceri, What you always wanted to know about Datalog (and never dared to ask), IEEE Transactions on Knowledge and Data Engineering, vol.1, issue.1, pp.146-166, 1989.
DOI : 10.1109/69.43410

. Ceri, Logic Programming and Databases, 1990.
DOI : 10.1007/978-3-642-83952-8

L. Cholvy and F. Cuppens, Analyzing consistency of security policies, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.103-112, 1997.
DOI : 10.1109/SECPRI.1997.601324

K. Cirstea, H. Cirstea, and C. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001.
DOI : 10.1093/jigpal/9.3.377

URL : https://hal.archives-ouvertes.fr/inria-00100532

. Cirstea, Rewrite Strategies in the Rewriting Calculus, Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(05)82613-1

URL : https://hal.archives-ouvertes.fr/inria-00099586

. Cirstea, Rule-based Programming in Java For Protocol Verification, Electronic Notes in Theoretical Computer Science, vol.117, pp.209-227, 2005.
DOI : 10.1016/j.entcs.2004.06.022

URL : https://hal.archives-ouvertes.fr/inria-00100025

. Clavel, 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

. Clavel, All About Maude -A High-Performance Logical Framework , How to Specify, Program and Verify Systems in Rewriting Logic, Lecture Notes in Computer Science, vol.4350, 2007.

H. Comon, Sufficient completeness, term rewriting systems and ???anti-unification???, Lecture Notes in Computer Science, vol.230, pp.128-140, 1986.
DOI : 10.1007/3-540-16780-3_85

. Cuppens, High Level Conflict Management Strategies in Advanced Access Control Models, Electronic Notes in Theoretical Computer Science, vol.186, pp.3-26, 2007.
DOI : 10.1016/j.entcs.2007.01.064

. Cuppens, Availability enforcement by obligations and aspects identification, First International Conference on Availability, Reliability and Security (ARES'06), pp.229-239, 2006.
DOI : 10.1109/ARES.2006.36

. Cuppens, Nomad: A Security Model with Non Atomic Actions and Deadlines, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.186-196, 2005.
DOI : 10.1109/CSFW.2005.20

M. Cuppens, F. Cuppens, and A. Miège, Adorbac: an administration model for or-bac, Comput. Syst. Sci. Eng, vol.19, issue.3, 2004.

. Damianou, The Ponder Policy Specification Language, POLICY, volume 1995 of Lecture Notes in Computer Science, pp.18-38, 2001.
DOI : 10.1007/3-540-44569-2_2

D. S. Dantas, Analyzing Security Advice in Functional Aspect-oriented Programming Languages, 2007.

M. Dauchet, Simulation of Turing machines by a regular rewrite rule, Theoretical Computer Science, vol.103, issue.2, pp.409-420, 1992.
DOI : 10.1016/0304-3975(92)90022-8

. Dauchet, Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems, Information and Computation, vol.88, issue.2, pp.187-201, 1990.
DOI : 10.1016/0890-5401(90)90015-A

O. De, Rewriting-based access control policies, Electr. Notes Theor. Comput. Sci, vol.171, issue.4, pp.59-72, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00112340

O. De, Weaving rewrite-based access control policies, FMSE '07: Proceedings of the 2007 ACM workshop on Formal methods in security engineering, pp.71-80, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00185710

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

N. Dershowitz, Hierarchical termination, Proceedings 4th International Workshop on Conditional Term Rewriting Systems, pp.89-105, 1994.
DOI : 10.1007/3-540-60381-6_6

URL : http://www.math.tau.ac.il/~nachumd/papers/LNCS/Topics.pdf

V. Di, Policies, models, and languages for access control, Lecture Notes in Computer Science, vol.3433, pp.225-237, 2005.

. Dougherty, Specifying and Reasoning About Dynamic Access-Control Policies, Lecture Notes in Computer Science, vol.4130, pp.632-646, 2006.
DOI : 10.1007/11814771_51

URL : http://www.cs.wpi.edu/~kfisler/Pubs/ijcar06.pdf

. Dougherty, Obligations and Their Interaction with Programs, pp.375-389, 2007.
DOI : 10.1007/978-3-540-74835-9_25

. Dougherty, Modular Access Control Via Strategic Rewriting, pp.578-593, 2007.
DOI : 10.1007/978-3-540-74835-9_38

URL : https://hal.archives-ouvertes.fr/inria-00185697

P. Echahed, 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

F. B. Schneider, Sasi enforcement of security policies: a retrospective, NSPW '99: Proceedings of the 1999 workshop on New security paradigms, pp.87-95, 2000.

T. Evans, D. Evans, and A. Twyman, Flexible Policy- Directed Code Safety, IEEE Symposium on Security and Privacy, 1999.
DOI : 10.1109/secpri.1999.766716

URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA446967&Location=U2&doc=GetTRDoc.pdf

. Fisler, Verification and change-impact analysis of access-control policies, ICSE, pp.196-205, 2005.

. Fournet, A type discipline for authorization policies, ACM Trans. Program. Lang. Syst, vol.29, issue.5, 2007.

. Gavrila, . Barkley, S. Gavrila, and J. Barkley, Formal specification for RBAC user/role and role/role relationship management, Proceedings of the 3rd ACM Workshop on Role-Based Access Control (RBAC-98), pp.81-90, 1998.

T. Genet, Contraintes d'ordre et automates d'arbres pour les preuves de terminaison, 1998.

I. Gnaedig, Termination of Priority Rewriting, 2008.
DOI : 10.1007/11814771_51

URL : https://hal.archives-ouvertes.fr/inria-00428679

. Gnaedig, . Kirchner, I. Gnaedig, and H. Kirchner, Computing constructor forms with non terminating rewrite programs, Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming , PPDP '06, pp.121-132, 2006.
DOI : 10.1145/1140335.1140351

URL : https://hal.archives-ouvertes.fr/inria-00112083

. Godoy, . Huntingford, G. Godoy, and E. Huntingford, Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems, pp.184-199, 2007.
DOI : 10.1007/978-3-540-73449-9_15

. Godoy, Termination of Rewriting with Right-Flat Rules, pp.200-213, 2007.
DOI : 10.1007/978-3-540-73449-9_16

. Godoy, Classes of term rewrite systems with polynomial confluence problems, ACM Transactions on Computational Logic, vol.5, issue.2, pp.321-331, 2004.
DOI : 10.1145/976706.976712

. Godoy, . Tiwari, G. Godoy, and A. Tiwari, Confluence of Shallow Right-Linear Rewrite Systems, Lecture Notes in Computer Science, vol.3634, pp.541-556, 2005.
DOI : 10.1007/11538363_37

. Godoy, . Tiwari, G. Godoy, and A. Tiwari, Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules, Lecture Notes in Computer Science, vol.3632, pp.164-176, 2005.
DOI : 10.1007/11532231_12

. Goguen, J. Malcolm-]-goguen, and G. Malcolm, Software Engineering with Obj: Algebraic Specification in Action, 2000.
DOI : 10.1007/978-1-4757-6541-0

. Goguen, J. A. Meseguer-]-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

. Gong, Inside Java 2 Platform Security: Architecture, Api Design, and Implementation, 2003.

B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, Proceedings of the 3rd Algebraic and Logic Programming Conference, pp.53-68, 1992.
DOI : 10.1007/BFb0013819

B. Gramlich, On proving termination by innermost termination, Lecture Notes in Computer Science, vol.1103, pp.93-107, 1996.
DOI : 10.1007/3-540-61464-8_45

. Guelev, Model-Checking Access Control Policies, Lecture Notes in Computer Science, vol.3225, pp.219-230, 2004.
DOI : 10.1007/978-3-540-30144-8_19

URL : http://www.cs.bham.ac.uk/~mdr/research/papers/pdf/04-acl-full.pdf

W. Halpern, J. Y. Halpern, and V. Weissman, Using first-order logic to reason about policies, CSFW, pp.187-201, 2003.

K. Hamlen, Security Policy Enforcement By automated Program- Rewriting, 2006.

. Harrison, Protection in operating systems, Communications of the ACM, vol.19, issue.8, pp.461-471, 1976.
DOI : 10.1145/360303.360333

R. Heintze, N. Heintze, and J. G. Riecke, The SLam calculus, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.365-377, 1998.
DOI : 10.1145/268946.268976

N. Hirokawa and A. Middeldorp, Tyrolean termination tool: Techniques and features, Information and Computation, vol.205, issue.4, pp.474-511, 2007.
DOI : 10.1016/j.ic.2006.08.010

URL : https://doi.org/10.1016/j.ic.2006.08.010

G. P. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

J. Hullot, Associative-commutative pattern matching, Proceedings 9th International Joint Conference on Artificial Intelligence, 1979.

P. Humenn, The formal semantics of XACML, 2003.

F. Jacquemard, Reachability and confluence are undecidable for flat term rewriting systems, Information Processing Letters, vol.87, issue.5, pp.265-270, 2003.
DOI : 10.1016/S0020-0190(03)00310-7

URL : https://hal.archives-ouvertes.fr/inria-00578875

T. Jaeger and J. Tidswell, Practical safety in flexible access control models, ACM Transactions on Information and System Security, vol.4, issue.2, pp.158-190, 2001.
DOI : 10.1145/501963.501966

. Jajodia, 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

. Jaume, . Morisset, M. Jaume, and C. Morisset, A formal approach to implement access control, Journal of Information Assurance and Security, vol.2, pp.137-148, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01195854

C. Morisset, Towards a formal specification of access control, Proceedings of FCS-ARSPA'06, pp.213-232, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01352113

. Jouannaud, . Kirchner, J. Jouannaud, and H. Kirchner, Completion of a Set of Rules Modulo a Set of Equations, SIAM Journal on Computing, vol.15, issue.4, pp.1155-1194, 1986.
DOI : 10.1137/0215084

. Kalam, Organization based access control. Policies for Distributed Systems and Networks, Proceedings. POLICY 2003. IEEE 4th International Workshop on, pp.120-131, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01483818

. Kiczales, An Overview of AspectJ, Lecture Notes in Computer Science, vol.2072, pp.327-353, 2001.
DOI : 10.1007/3-540-45337-7_18

. Kiczales, Aspect-oriented programming, ECOOP, pp.220-242, 1997.

C. Kirchner, Strategic Rewriting, Electronic Notes in Theoretical Computer Science, vol.124, issue.2, pp.3-9, 2005.
DOI : 10.1016/j.entcs.2004.11.017

URL : https://hal.archives-ouvertes.fr/inria-00107802

. Kirchner, Strategic computations and deductions, 2008.

. Kirchner, Designing CLP using computational systems, Principles and Practice of Constraint Programming, pp.133-160, 1995.

. Kirchner, Anti-pattern Matching, Lecture Notes in Computer Science, vol.4421, pp.110-124, 2007.
DOI : 10.1007/978-3-540-71316-6_9

URL : https://hal.archives-ouvertes.fr/inria-00129421

. Kirchner, Formal validation of pattern matching code, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.187-197, 2005.
DOI : 10.1145/1069774.1069792

URL : https://hal.archives-ouvertes.fr/inria-00000701

. Knuth, . Bendix, D. E. Knuth, and P. B. Bendix, Simple Word Problems in Universal Algebras, Computational Problems in Abstract Algebra, pp.263-297, 1970.
DOI : 10.1007/978-3-642-81955-1_23

. Koch, Decidability of Safety in Graph-Based Models for Access Control, ESORICS, volume 2502 of Lecture Notes in Computer Science, pp.229-243, 2002.
DOI : 10.1007/3-540-45853-0_14

. Kurihara, . Ohuchi, M. Kurihara, and A. Ohuchi, Modularity of simple termination of term rewriting systems, Journal of IPS Japan, issue.5, pp.31633-642, 1990.

. Kurihara, . Ohuchi, M. Kurihara, and A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors, Theoretical Computer Science, vol.103, issue.2, pp.273-282, 1992.
DOI : 10.1016/0304-3975(92)90015-8

B. W. Lampson, Protection, ACM SIGOPS Operating Systems Review, vol.8, issue.1, pp.18-24, 1974.
DOI : 10.1145/775265.775268

. Lee, Defeasible security policy composition for web services, Proceedings of the fourth ACM workshop on Formal methods in security , FMSE '06, pp.45-54, 2006.
DOI : 10.1145/1180337.1180342

M. Li, N. Li, and J. C. Mitchell, Datalog with Constraints: A Foundation for Trust Management Languages, PADL, volume 2562 of Lecture Notes in Computer Science, pp.58-73, 2003.
DOI : 10.1007/3-540-36388-2_6

. Ligatti, Enforcing Non-safety Security Policies with Program Monitors, ESORICS, pp.355-373, 2005.
DOI : 10.1007/11555827_21

U. Marché, C. Marché, and X. Urbain, Modular and incremental proofs of AC-termination, Journal of Symbolic Computation, vol.38, issue.1, pp.873-897, 2004.
DOI : 10.1016/j.jsc.2004.02.003

N. Martí-oliet and J. Meseguer, Rewriting logic: roadmap and bibliography, Theoretical Computer Science, vol.285, issue.2, pp.121-154, 2002.
DOI : 10.1016/S0304-3975(01)00357-7

. Martí-oliet, Towards a Strategy Language for Maude, Electronic Notes in Theoretical Computer Science, vol.117, pp.417-441, 2005.
DOI : 10.1016/j.entcs.2004.06.020

. Mclean, The algebra of security, Proceedings. 1988 IEEE Symposium on Security and Privacy, pp.2-7, 1988.
DOI : 10.1109/SECPRI.1988.8092

J. Mclean, A comment on the ???basic security theorem??? of Bell and LaPadula, Information Processing Letters, vol.20, issue.2, pp.67-70, 1985.
DOI : 10.1016/0020-0190(85)90065-1

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

T. Middeldorp, A. Middeldorp, and Y. Toyama, Completeness of combinations of constructor systems, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy). also Report CS-R9058, CWI, 1990.

A. Miège, Definition of a formal framework for specifying security policies . The Or-BAC model and extensions, 2005.

C. Morisset, Définition d'un cadre sémantique pour la spécification, l'implantation et la comparaison de modèles de contrôle d'accès, 2007.

D. Morisset, . Oliveira, C. Morisset, and A. S. De-oliveira, Automated detection of information leakage in access control, Second International Workshop on Security and Rewriting Techniques -SecReT, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00185713

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

A. C. Myers, JFlow, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.228-241, 1999.
DOI : 10.1145/292540.292561

. Naldurg, NE- TRA: : seeing through access control, pp.55-66, 2006.

E. Ohlebusch, Advanced Topics in Term Rewriting, 2002.
DOI : 10.1007/978-1-4757-3661-8

E. Ohlebusch, Hierarchical termination revisited, Information Processing Letters, vol.84, issue.4, pp.207-214, 2002.
DOI : 10.1016/S0020-0190(02)00272-7

. Park, . Sandhu, J. Park, and R. Sandhu, usage control model, ACM Transactions on Information and System Security, vol.7, issue.1, pp.128-174, 2004.
DOI : 10.1145/984334.984339

W. Paterson, M. S. Paterson, and M. N. Wegman, Linear unification, Journal of Computer and System Sciences, vol.16, issue.2, pp.158-167, 1978.
DOI : 10.1016/0022-0000(78)90043-0

. Peterson, G. E. Peterson, and M. E. Stickel, Complete Sets of Reductions for Some Equational Theories, Journal of the ACM, vol.28, issue.2, pp.233-264, 1981.
DOI : 10.1145/322248.322251

A. Reilles, Canonical Abstract Syntax Trees, Electronic Notes in Theoretical Computer Science, vol.176, issue.4, pp.165-179, 2007.
DOI : 10.1016/j.entcs.2007.06.014

URL : https://hal.archives-ouvertes.fr/inria-00000967

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

P. Ryan, Mathematical Models of Computer Security. Foundations of Security Analysis and Design, p.2171, 2000.

A. Sabelfeld and A. Myers, Language-based information-flow security . Selected Areas in Communications, IEEE Journal on, vol.21, issue.1, pp.5-19, 2003.
DOI : 10.1109/jsac.2002.806121

URL : http://www.cs.cornell.edu/andru/papers/jsac/sm-jsac03.pdf

. Sandhu, The ARBAC97 model for role-based administration of roles, ACM Transactions on Information and System Security, vol.2, issue.1, pp.105-135, 1999.
DOI : 10.1145/300830.300839

. Sandhu, The NIST model for rolebased access control: towards a unified standard, RBAC '00: Proceedings of the fifth ACM workshop on Role-based access control, pp.47-63, 2000.

R. S. Sandhu, Lattice-based access control models, Computer, vol.26, issue.11, pp.9-19, 1993.
DOI : 10.1109/2.241422

URL : http://www.list.gmu.edu/journals/computer/pdf_ver/i93lbacm.pdf

F. B. Schneider, Enforceable security policies, ACM Transactions on Information and System Security, vol.3, issue.1, pp.30-50, 2000.
DOI : 10.1145/353323.353382

. Schneider-kamp, Automated Termination Analysis for Logic Programs by Term Rewriting, Lecture Notes in Computer Science, vol.4407, pp.177-193, 2007.
DOI : 10.1007/978-3-540-71410-1_13

. Song, Verifiable composition of access control and application features, Proceedings of the tenth ACM symposium on Access control models and technologies , SACMAT '05, pp.120-129, 2005.
DOI : 10.1145/1063979.1064001

Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Information Processing Letters, vol.25, issue.3, pp.141-143, 1987.
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

. Tschantz, . Krishnamurthi, M. C. Tschantz, and S. Krishnamurthi, Towards reasonability properties for access-control policy languages, Proceedings of the eleventh ACM symposium on Access control models and technologies , SACMAT '06, pp.160-169, 2006.
DOI : 10.1145/1133058.1133081

E. Visser, Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5, Lecture Notes in Computer Science, vol.2051, pp.357-362, 2001.
DOI : 10.1007/3-540-45127-7_27

S. Wang, Y. Wang, and M. Sakai, Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems, Lecture Notes in Computer Science, vol.4098, pp.343-356, 2006.
DOI : 10.1007/11805618_26

D. Wijesekera and S. Jajodia, A propositional policy algebra for access control, ACM Transactions on Information and System Security, vol.6, issue.2, pp.286-325, 2003.
DOI : 10.1145/762476.762481

. Winslett, PeerAccess, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.168-179, 2005.
DOI : 10.1145/1102120.1102144

H. Zantema, Termination of term rewriting by semantic labelling, Fundam. Inform, vol.24, issue.12, pp.89-105, 1995.