201 search results - page 1 / 41 » An Authorization Logic With Explicit Time |
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
COLING
2002
13 years 8 months ago
2002
We present a principled approach to the problem of connecting a controlled document authoring system with a knowledge base. We start by describingclosed-world authoring situations...
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
ENTCS
2008
13 years 8 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
CSFW
2007
IEEE
14 years 13 days ago
2007
IEEE
We consider the problem of statically verifying the conformance of the code of a system to an explicit authorization policy. In a distributed setting, some part of the system may ...