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
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
A needed narrowing strategy, Journal of the ACM, vol.47, issue.4, pp.776-822, 2000. ,
DOI : 10.1145/347476.347484
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
Term Rewriting and all That, 1998. ,
Unification theory, Handbook of Automated Reasoning, pp.445-532, 2001. ,
Piggybacking rewriting on java, pp.36-47, 2007. ,
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
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
Optimizing pattern matching compilation by program transformation Electronic Communications of EASST, 3rd Workshop on Software Evolution through Transformations (SeTra'06), 2006. ,
Magic sets and other strange ways to implement logic programs, PODS, pp.1-15, 1986. ,
Term Rewriting for Access Control, Lecture Notes in Computer Science, vol.7, issue.1, pp.179-193, 2006. ,
DOI : 10.1145/984334.984339
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
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
A calculus for composing security policies, 2002. ,
Composing security policies with polymer, [Sarkar and Hall, pp.305-314, 2005. ,
A logic for state-modifying authorization policies, pp.203-218, 2007. ,
DOI : 10.1145/1805974.1805976
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.5503
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
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
Secure computer systems: A mathematical model, volume ii, Journal of Computer Security, vol.4, issue.23, pp.229-263, 1996. ,
Secure computer systems: Mathematical foundations, Mitre Corporation, 1974. ,
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
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
Dynamic Event-Based Access Control as Term Rewriting, DBSec, pp.195-210, 2007. ,
DOI : 10.1109/2.485845
Integrity considerations for secure computer systems, 1977. ,
On the structure of abstract algebras, Proc. Camb. Philos. Soc, pp.433-454, 1935. ,
Computer Security -ES- ORICS, 12th European Symposium On Research In Computer Security Proceedings, volume 4734 of Lecture Notes in Computer Science, 2007. ,
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
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
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
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
An Overview of ELAN, Electronic Notes in Theoretical Computer Science, vol.15, 1998. ,
DOI : 10.1016/S1571-0661(05)82552-6
REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS, International Journal of Foundations of Computer Science, vol.12, issue.01, pp.69-95, 2001. ,
DOI : 10.1142/S0129054101000412
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
Automatic verification of sufficient completeness for conditional constrained term rewriting systems, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00070163
The Chinese Wall security policy, Proceedings. 1989 IEEE Symposium on Security and Privacy, pp.206-214, 1989. ,
DOI : 10.1109/SECPRI.1989.36295
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.8977
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
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
Logic Programming and Databases, 1990. ,
DOI : 10.1007/978-3-642-83952-8
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
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
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
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
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
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. ,
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
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
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
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
Adorbac: an administration model for or-bac, Comput. Syst. Sci. Eng, vol.19, issue.3, 2004. ,
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
Analyzing Security Advice in Functional Aspect-oriented Programming Languages, 2007. ,
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
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
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
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
Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982. ,
DOI : 10.1016/0304-3975(82)90026-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.4058
Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987. ,
DOI : 10.1016/S0747-7171(87)80022-6
Hierarchical termination, Proceedings 4th International Workshop on Conditional Term Rewriting Systems, pp.89-105, 1994. ,
DOI : 10.1007/3-540-60381-6_6
Policies, models, and languages for access control, Lecture Notes in Computer Science, vol.3433, pp.225-237, 2005. ,
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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.8098
Obligations and Their Interaction with Programs, pp.375-389, 2007. ,
DOI : 10.1007/978-3-540-74835-9_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.1733
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
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
Sasi enforcement of security policies: a retrospective, NSPW '99: Proceedings of the 1999 workshop on New security paradigms, pp.87-95, 2000. ,
Flexible policy-directed code safety, Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344), 1999. ,
DOI : 10.1109/SECPRI.1999.766716
Verification and change-impact analysis of access-control policies, ICSE, pp.196-205, 2005. ,
A type discipline for authorization policies, ACM Trans. Program. Lang. Syst, vol.29, issue.5, 2007. ,
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. ,
Contraintes d'ordre et automates d'arbres pour les preuves de terminaison, 1998. ,
Termination of Priority Rewriting, 2008. ,
DOI : 10.1007/11814771_51
URL : https://hal.archives-ouvertes.fr/inria-00428679
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
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
Termination of Rewriting with Right-Flat Rules, pp.200-213, 2007. ,
DOI : 10.1007/978-3-540-73449-9_16
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
Confluence of Shallow Right-Linear Rewrite Systems, Lecture Notes in Computer Science, vol.3634, pp.541-556, 2005. ,
DOI : 10.1007/11538363_37
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
Software Engineering with Obj: Algebraic Specification in Action, 2000. ,
DOI : 10.1007/978-1-4757-6541-0
Security Policies and Security Models, 1982 IEEE Symposium on Security and Privacy, pp.11-20, 1982. ,
DOI : 10.1109/SP.1982.10014
Inside Java 2 Platform Security: Architecture, Api Design, and Implementation, 2003. ,
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
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.6464
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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2061
Using First-Order Logic to Reason about Policies, CSFW, pp.187-201, 2003. ,
DOI : 10.1145/1380564.1380569
URL : http://arxiv.org/abs/cs/0601034
Security Policy Enforcement By automated Program- Rewriting, 2006. ,
Protection in operating systems, Communications of the ACM, vol.19, issue.8, pp.461-471, 1976. ,
DOI : 10.1145/360303.360333
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
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 : http://doi.org/10.1016/j.ic.2006.08.010
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
Associative-commutative pattern matching, Proceedings 9th International Joint Conference on Artificial Intelligence, 1979. ,
The formal semantics of XACML, 2003. ,
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
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
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 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
Towards a formal specification of access control, Proceedings of FCS-ARSPA'06, pp.213-232, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-01352113
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
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
An Overview of AspectJ, Lecture Notes in Computer Science, vol.2072, pp.327-353, 2001. ,
DOI : 10.1007/3-540-45337-7_18
Aspect-oriented programming, ECOOP, pp.220-242, 1997. ,
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
Strategic computations and deductions, 2008. ,
Designing CLP using computational systems, Principles and Practice of Constraint Programming, pp.133-160, 1995. ,
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-00337722
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
Simple Word Problems in Universal Algebras, Computational Problems in Abstract Algebra, pp.263-297, 1970. ,
DOI : 10.1007/978-3-642-81955-1_23
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
Modularity of simple termination of term rewriting systems, Journal of IPS Japan, issue.5, pp.31633-642, 1990. ,
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
Protection, ACM SIGOPS Operating Systems Review, vol.8, issue.1, pp.18-24, 1974. ,
DOI : 10.1145/775265.775268
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
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
Enforcing Non-safety Security Policies with Program Monitors, ESORICS, pp.355-373, 2005. ,
DOI : 10.1007/11555827_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.7862
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
Rewriting logic: roadmap and bibliography, Theoretical Computer Science, vol.285, issue.2, pp.121-154, 2002. ,
DOI : 10.1016/S0304-3975(01)00357-7
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
The algebra of security, Proceedings. 1988 IEEE Symposium on Security and Privacy, pp.2-7, 1988. ,
DOI : 10.1109/SECPRI.1988.8092
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 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
Completeness of combinations of constructor systems, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy). also Report CS-R9058, CWI, 1990. ,
Definition of a formal framework for specifying security policies . The Or-BAC model and extensions, 2005. ,
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. ,
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
Extensible access control markup language (XACML) version 2.0, 2005. ,
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
NE- TRA: : seeing through access control, pp.55-66, 2006. ,
Advanced Topics in Term Rewriting, 2002. ,
DOI : 10.1007/978-1-4757-3661-8
Hierarchical termination revisited, Information Processing Letters, vol.84, issue.4, pp.207-214, 2002. ,
DOI : 10.1016/S0020-0190(02)00272-7
usage control model, ACM Transactions on Information and System Security, vol.7, issue.1, pp.128-174, 2004. ,
DOI : 10.1145/984334.984339
Linear unification, Journal of Computer and System Sciences, vol.16, issue.2, pp.158-167, 1978. ,
DOI : 10.1016/0022-0000(78)90043-0
URL : http://doi.org/10.1016/0022-0000(78)90043-0
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
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
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
Mathematical Models of Computer Security. Foundations of Security Analysis and Design, p.2171, 2000. ,
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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3979
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
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. ,
Lattice-based access control models, Computer, vol.26, issue.11, pp.9-19, 1993. ,
DOI : 10.1109/2.241422
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5742
Enforceable security policies, ACM Transactions on Information and System Security, vol.3, issue.1, pp.30-50, 2000. ,
DOI : 10.1145/353323.353382
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1853
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
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
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
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
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
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
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
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
PeerAccess, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.168-179, 2005. ,
DOI : 10.1145/1102120.1102144
Termination of term rewriting by semantic labelling, Fundam. Inform, vol.24, issue.12, pp.89-105, 1995. ,