Computability classes for enforcement mechanisms Export

@article{citeulike:4922293, abstract = {A precise characterization of those security policies enforceable by program rewriting is given. This also exposes and rectifies problems in prior work, yielding a better characterization of those security policies enforceable by execution monitors as well as a taxonomy of enforceable security policies. Some but not all classes can be identified with known classes from computational complexity theory.}, address = {New York, NY, USA}, author = {Hamlen, Kevin W. and Morrisett, Greg and Schneider, Fred B.}, citeulike-article-id = {4922293}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1111601}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1111596.1111601}, doi = {10.1145/1111596.1111601}, issn = {0164-0925}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {2006, complexity, enforcement}, number = {1}, pages = {175--205}, posted-at = {2009-06-22 12:23:37}, priority = {2}, publisher = {ACM}, title = {Computability classes for enforcement mechanisms}, url = {http://dx.doi.org/10.1145/1111596.1111601}, volume = {28}, year = {2006} }

TY - JOUR ID - citeulike:4922293 L3 - citeulike-article-id:4922293 N2 - A precise characterization of those security policies enforceable by program rewriting is given. This also exposes and rectifies problems in prior work, yielding a better characterization of those security policies enforceable by execution monitors as well as a taxonomy of enforceable security policies. Some but not all classes can be identified with known classes from computational complexity theory. IS - 1 JF - ACM Trans. Program. Lang. Syst. SN - 0164-0925 AD - New York, NY, USA EP - 205 TI - Computability classes for enforcement mechanisms PB - ACM VL - 28 SP - 175 KW - 2006 KW - complexity KW - enforcement AU - Hamlen, Kevin AU - Morrisett, Greg AU - Schneider, Fred PY - 2006/// UR - http://dx.doi.org/10.1145/1111596.1111601 ER -