Download now Free registration required
The authors present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, they study the meta-theory of the logic, including cut elimination. They also demonstrate formal connections to proof-carrying authorization's existing approach for handling time and comment on the enforceability of their logic in the same framework. Finally, they illustrate the expressiveness of the logic through examples, including those with complex interactions between time, authorization, and mutable state. Most secure systems restrict operations that users, machines, and other principals can perform on files and other resources. A reference monitor authorizes (or denies) requests to access resources, in consultation with a set of rules called the security policy.
- Format: PDF
- Size: 197.6 KB