On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Sufficient completeness, term rewriting systems and “anti-unification”
Proc. of the 8th international conference on Automated deduction
On termination of the direct sum of term-rewriting systems
Information Processing Letters
Journal of Symbolic Computation
A sufficient condition for the termination of the direct sum of term rewriting systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
Completeness of combinations of constructor systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Modularity of simple termination of term rewriting systems with shared constructors
Theoretical Computer Science
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
An algebra for composing access control policies
ACM Transactions on Information and System Security (TISSEC)
Advanced topics in term rewriting
Advanced topics in term rewriting
Term Rewriting Systems
Stratego: A Language for Program Transformation Based on Rewriting Strategies
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On Proving Termination by Innermost Termination
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Generalized Sufficient Conditions for Modular Termination of Rewriting
Proceedings of the Third International Conference on Algebraic and Logic Programming
SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
A propositional policy algebra for access control
ACM Transactions on Information and System Security (TISSEC)
ACM SIGOPS Operating Systems Review
Organization based access control
POLICY '03 Proceedings of the 4th IEEE International Workshop on Policies for Distributed Systems and Networks
Composing security policies with polymer
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Defeasible security policy composition for web services
Proceedings of the fourth ACM workshop on Formal methods in security
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
A rewriting framework for the composition of access control policies
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Handling inheritance violation for secure interoperation of heterogeneous systems
International Journal of Security and Networks
Component-based security policy design with colored Petri nets
Semantics and algebraic specification
Security rules versus security properties
ICISS'10 Proceedings of the 6th international conference on Information systems security
An access control language based on term rewriting and description logic
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Modularisation in maude of parametrized RBAC for row level access control
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
HiPoLDS: a security policy language for distributed systems
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Automated analysis of rule-based access control policies
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
HiPoLDS: A Hierarchical Security Policy Language for Distributed Systems
Information Security Tech. Report
| Hi-index | 0.00 |
Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular way using techniques developed in the field of term rewriting, focusing especially on the use of rewriting strategies. Term rewriting supports a formalization of access control with a clear declarative semantics based on equational logic and an operational semantics guided by strategies. Well-established term rewriting techniques allow us to check properties of policies such as the absence of conflicts and the property of always returning a decision. A rich language for expressing rewriting strategies is used to define a theory of modular construction of policies, in which we can better understand the preservation of properties of policies under composition. The robustness of the approach is illustrated on the composition operators of XACML.