Computer Science Department
School of Computer Science, Carnegie Mellon University
Henry DeYoung, Deepak Garg, Frank Pfenning
We present an authorization logic that permits reasoning with explicit time. Following a prooftheoretic 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.