Summary: An Authorization Logic with Explicit Time1
Henry DeYoung Deepak Garg Frank Pfenning
February 2, 2008
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
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 authorization's existing approach for handling
time and comment on the enforceability of our logic in the same framework. Finally, we illustrate
the expressiveness of the logic through examples, including those with complex interactions between
time, authorization, and mutable state.
This research was sponsored by the Air Force Research Laboratory under grant no. FA87500720028. The views
and conclusions contained in this document are those of the authors and should not be interpreted as representing
official policies, either expressed or implied, of any sponsoring institution, the U.S. government or any other entity.
Keywords: access control logic, hybrid logic, temporal logic, proof-carrying authorization