Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Signed data dependencies in logic programs
Journal of Logic Programming
How to control unfolding when specializing interpreters
New Generation Computing
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Tutorial on specialisation of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Meta-logics and logic programming
Meta-logics and logic programming
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
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
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
Partial Evaluation of Computation Process—AnApproach to a Compiler-Compiler
Higher-Order and Symbolic Computation
Partial Evaluation, Self-Application and Types
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
WWW '03 Proceedings of the 12th international conference on World Wide Web
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
An Introduction to Database Systems
An Introduction to Database Systems
A System to Specify and Manage Multipolicy Access Control Models
POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
Flexible access control policy specification with constraint logic programming
ACM Transactions on Information and System Security (TISSEC)
Offline specialisation in Prolog using a hand-written compiler generator
Theory and Practice of Logic Programming
Efficient and flexible access control via logic program specialisation
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
ACM Transactions on Information and System Security (TISSEC)
An investigation of Jones optimality and BTI-universal specializers
Higher-Order and Symbolic Computation
Personalizing access control by generalizing access control
Proceedings of the 15th ACM symposium on Access control models and technologies
SEAL: a logic programming framework for specifying and verifying access control models
Proceedings of the 16th ACM symposium on Access control models and technologies
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
| Hi-index | 0.00 |
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a database and an access policy specification. For processing access control requests we specialise the meta-program for a given access policy and database by using the logen partial evaluation system. The resulting specialised control checking program is dependent solely upon dynamic information that can only be known at the time of actual access request evaluation. In addition to describing our approach, we give a number of performance measures for our implementation of an access control checker. In particular, we show that by using our approach we get flexible access control with virtually no overhead, satisfying the Jones optimality criterion. The paper also shows how to satisfy the Jones optimality criterion more generally for interpreters written in the non-ground representation.