• DATALOG with constraints : A f...

Treffer: DATALOG with constraints : A foundation for trust management languages

Title:
DATALOG with constraints : A foundation for trust management languages
Authors:
NINGHUI LI, MITCHELL, John C
Source:
PADL 2003 : practical aspects of declarative languages (New Orleans LA, 13-14 January 2003)Lecture notes in computer science. :58-73
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Systèmes d'information. Bases de données, Information systems. Data bases, Base donnée, Database, Base dato, Complexité calcul, Computational complexity, Complejidad computación, Contrôle accès, Access control, DATALOG, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Système réparti, Distributed system, Sistema repartido, DATALOG ave contrainte, Langage déclaratif, Declarative language, Trust management language
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Stanford University, Gates 4B, Stanford, CA 94305-9045, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15133196
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15133196
Database:
PASCAL Archive

Weitere Informationen

Trust management (TM) is a promising approach for authorization and access control in distributed systems, based on signed distributed policy statements expressed in a policy language. Although several TM languages are semantically equivalent to subsets of DATALOG, DATALOG is not sufficiently expressive for fine-grained control of structured resources. We define the class of linearly decomposable unary constraint domains, prove that DATALOG extended with constraints in any combination of such constraint domains is tractable, and show that permissions associated with structured resources fall into this class. We also present a concrete declarative TM language, RTC1, based on constraint DATALOG, and use constraint DATALOG to analyze another TM system, KeyNote, which turns out to be less expressive than RTC1 in significant respects, yet less tractable in the worst case. Although constraint DATALOG has been studied in the context of constraint databases, TM applications involve different kinds of constraint domains and have different computational complexity requirements.