Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Confluence of the lambda calculus with left-linear algebraic rewriting
Information Processing Letters
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Polymorphic rewriting conserves algebraic confluence
Information and Computation
Intersection type assignment systems with higher-order algebraic rewriting
Theoretical Computer Science
The definition of extended ML: a gentle introduction
Theoretical Computer Science - Special issue: algebraic development techniques
Normalization results for typeable rewrite systems
Information and Computation
Term rewriting and all that
The NIST model for role-based access control: towards a unified standard
RBAC '00 Proceedings of the fifth ACM workshop on Role-based access control
A logical framework for reasoning about access control models
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
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)
Theoretical Computer Science - Special issue on theories of types and proofs
Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Jakarta: A Toolset for Reasoning about JavaCard
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
A propositional policy algebra for access control
ACM Transactions on Information and System Security (TISSEC)
ACM SIGOPS Operating Systems Review
Access control: principles and solutions
Software—Practice & Experience - Special issue: Security software
Flexible access control policy specification with constraint logic programming
ACM Transactions on Information and System Security (TISSEC)
Security policy in a declarative style
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Distributed event-based access control
International Journal of Information and Computer Security
Component-based security policy design with colored Petri nets
Semantics and algebraic specification
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
Rewrite specifications of access control policies in distributed environments
STM'10 Proceedings of the 6th international conference on Security and trust management
| Hi-index | 0.00 |
In large, and often distributed, environments, where access control information may be shared across multiple sites, the combination of individual specifications in order to define a coherent access control policy is of fundamental importance. In order to ensure non-ambiguous behaviour, formal languages, often relying on firstorder logic, have been developed for the description of access control policies. We propose in this paper a formalisation of policy composition by means of term rewriting. We show how, in this setting, we are able to express a wide range of policy combinations and reason about them. Modularity properties of rewrite systems can be used to derive the correctness of the global policy, i.e. that every access request has an answer and this answer is unique