Sciweavers

Share
CSFW
2008
IEEE

An Authorization Logic With Explicit Time

8 years 8 months ago
An Authorization Logic With Explicit Time
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.
Henry DeYoung, Deepak Garg, Frank Pfenning
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where CSFW
Authors Henry DeYoung, Deepak Garg, Frank Pfenning
Comments (0)
books