An Authorization Logic with Explicit Time
CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
Pagination or Media Count:
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. We also demonstrate formal connections to proof-carrying authorizations existing approach for handling time and comment on the enforceability of our logic in the same framework. Finally, we illustrate including those with complex interactions between time, authorization, and mutable state.
- Computer Systems Management and Standards