An Authorization Logic With Explicit Time Export

@proceedings{citeulike:5298154, abstract = {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.}, address = {Los Alamitos, CA, USA}, author = {DeYoung, Henry and Garg, Deepak and Pfenning, Frank}, booktitle = {CSF '08: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium}, citeulike-article-id = {5298154}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1381250}, citeulike-linkout-1 = {http://doi.ieeecomputersociety.org/10.1109/CSF.2008.15}, citeulike-linkout-2 = {http://dx.doi.org/10.1109/CSF.2008.15}, citeulike-linkout-3 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4556683}, day = {09}, doi = {10.1109/CSF.2008.15}, isbn = {978-0-7695-3182-3}, journal = {Computer Security Foundations Symposium, 2008. CSF '08. IEEE 21st}, keywords = {authorization-logic, security, temporal-logic}, month = {July}, pages = {133--145}, posted-at = {2009-07-29 13:38:16}, priority = {2}, publisher = {IEEE Computer Society}, title = {An Authorization Logic With Explicit Time}, url = {http://dx.doi.org/10.1109/CSF.2008.15}, volume = {0}, year = {2008} }

TY - CONF ID - citeulike:5298154 L3 - citeulike-article-id:5298154 N2 - 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. JF - Computer Security Foundations Symposium, 2008. CSF '08. IEEE 21st SN - 978-0-7695-3182-3 AD - Los Alamitos, CA, USA EP - 145 TI - An Authorization Logic With Explicit Time PB - IEEE Computer Society VL - 0 T2 - CSF '08: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium SP - 133 KW - authorization-logic KW - security KW - temporal-logic AU - DeYoung, Henry AU - Garg, Deepak AU - Pfenning, Frank PY - 2008/07/09/ UR - http://dx.doi.org/10.1109/CSF.2008.15 ER -