2008 21st IEEE Computer Security Foundations Symposium An Authorization Logic With Explicit Time June 23-June 25 ISBN: 978-0-7695-3182-3
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSF.2008.15
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.
Index Terms:
Authorization Logic, Hybrid Logic, Explicit Time
Citation:
Henry DeYoung, Deepak Garg, Frank Pfenning, "An Authorization Logic With Explicit Time," csf, pp.133-145, 2008 21st IEEE Computer Security Foundations Symposium, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||