{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T02:01:40Z","timestamp":1791424900596,"version":"4.3.3"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2006,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1111596.1111601","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:07:09Z","timestamp":1139238429000},"page":"175-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":142,"title":["Computability classes for enforcement mechanisms"],"prefix":"10.1145","volume":"28","author":[{"given":"Kevin W.","family":"Hamlen","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Greg","family":"Morrisett","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred B.","family":"Schneider","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,1]]},"reference":[{"key":"e_1_2_1_2_1","volume-title":"Information Processing (Proceedings of the IFIP Congress). 320--326","author":"Deutsch P.","unstructured":"Deutsch , P. and Grant , C . 1971. A flexible measurement tool for software systems . In Information Processing (Proceedings of the IFIP Congress). 320--326 .]] Deutsch, P. and Grant, C. 1971. A flexible measurement tool for software systems. In Information Processing (Proceedings of the IFIP Congress). 320--326.]]"},{"key":"e_1_2_1_3_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Erlingsson","unstructured":"Erlingsson , \u00da. and Schneider, F. B . 2000a. IRM enforcement of Java stack inspection . In IEEE Symposium on Security and Privacy . Oakland, California, 246--255.]] Erlingsson, \u00da. and Schneider, F. B. 2000a. IRM enforcement of Java stack inspection. In IEEE Symposium on Security and Privacy. Oakland, California, 246--255.]]"},{"key":"e_1_2_1_4_1","volume-title":"WNSP: New Security Paradigms Workshop. ACM Press.]] 10","author":"Erlingsson","unstructured":"Erlingsson , \u00da. and Schneider, F. B . 2000b. SASI enforcement of security policies: A retrospective . In WNSP: New Security Paradigms Workshop. ACM Press.]] 10 .1145\/335169.335201 Erlingsson, \u00da. and Schneider, F. B. 2000b. SASI enforcement of security policies: A retrospective. In WNSP: New Security Paradigms Workshop. ACM Press.]] 10.1145\/335169.335201"},{"key":"e_1_2_1_5_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Evans D.","unstructured":"Evans , D. and Twynman , A . 1999. Flexible policy-directed code safety . In IEEE Symposium on Security and Privacy . Oakland, California, 32--45.]] Evans, D. and Twynman, A. 1999. Flexible policy-directed code safety. In IEEE Symposium on Security and Privacy. Oakland, California, 32--45.]]"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 2004 IEEE Symposium on Security and Privacy","author":"Fong P. W. L.","year":"2004","unstructured":"Fong , P. W. L. 2004 . Access control by tracking shallow execution history . In Proceedings of the 2004 IEEE Symposium on Security and Privacy . Berkeley, California, 43--55.]] Fong, P. W. L. 2004. Access control by tracking shallow execution history. In Proceedings of the 2004 IEEE Symposium on Security and Privacy. Berkeley, California, 43--55.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","article-title":"\u00dcber formal unentscheidbare s\u00e4tze der Principia Mathematica und verwandter Systeme","volume":"38","author":"G\u00f6del K.","year":"1931","unstructured":"G\u00f6del , K. 1931 . \u00dcber formal unentscheidbare s\u00e4tze der Principia Mathematica und verwandter Systeme . Monatshefte f\u00fcr Mathematik und Physik 38 , 173 -- 198 .]] G\u00f6del, K. 1931. \u00dcber formal unentscheidbare s\u00e4tze der Principia Mathematica und verwandter Systeme. Monatshefte f\u00fcr Mathematik und Physik 38, 173--198.]]","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/360303.360333"},{"key":"e_1_2_1_9_1","unstructured":"Hopcroft J. E. and Ullman J. D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley.]]   Hopcroft J. E. and Ullman J. D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley.]]"},{"key":"e_1_2_1_10_1","volume-title":"European Conference on Object-Oriented Programming, M. Ak\u015fit and S. Matsuoka, Eds.","volume":"1241","author":"Kiczales G.","unstructured":"Kiczales , G. , Lamping , J. , Medhdhekar , A. , Maeda , C. , Lopes , C. , Loingtier , J.-M. , and Irwin , J . 1997. Aspect-oriented programming . In European Conference on Object-Oriented Programming, M. Ak\u015fit and S. Matsuoka, Eds. Vol. 1241 . Springer-Verlag, Berlin, Heidelberg, and New York, 220--242.]] Kiczales, G., Lamping, J., Medhdhekar, A., Maeda, C., Lopes, C., Loingtier, J.-M., and Irwin, J. 1997. Aspect-oriented programming. In European Conference on Object-Oriented Programming, M. Ak\u015fit and S. Matsuoka, Eds. Vol. 1241. Springer-Verlag, Berlin, Heidelberg, and New York, 220--242.]]"},{"key":"e_1_2_1_11_1","volume-title":"First International Workshop on Run-time Verification","author":"Kim M.","unstructured":"Kim , M. , Kannon , S. , Lee ., I., and Sokolsky , O . 2001. Java-MaC: A run-time assurance tool for Java . In First International Workshop on Run-time Verification . Paris, France.]] Kim, M., Kannon, S., Lee., I., and Sokolsky, O. 2001. Java-MaC: A run-time assurance tool for Java. In First International Workshop on Run-time Verification. Paris, France.]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","article-title":"Proving the correctness of multiprocess programs","volume":"2","author":"Lamport L.","year":"1977","unstructured":"Lamport , L. 1977 . Proving the correctness of multiprocess programs . IEEE Trans. Soft. Eng. SE-3 2 , 125 -- 143 .]] Lamport, L. 1977. Proving the correctness of multiprocess programs. IEEE Trans. Soft. Eng. SE-3 2, 125--143.]]","journal-title":"IEEE Trans. Soft. Eng. SE-3"},{"key":"e_1_2_1_13_1","volume-title":"Protection. In Proceedings of the 5th Symposium on Information Sciences and Systems","author":"Lampson B.","year":"1971","unstructured":"Lampson , B. 1971 . Protection. In Proceedings of the 5th Symposium on Information Sciences and Systems . Princeton, New Jersey, 437--443.]] Lampson, B. 1971. Protection. In Proceedings of the 5th Symposium on Information Sciences and Systems. Princeton, New Jersey, 437--443.]]"},{"key":"e_1_2_1_14_1","volume-title":"Tech. Rep. TR-681-03","author":"Ligatti J.","year":"2003","unstructured":"Ligatti , J. , Bauer , L. , and Walker , D . 2003 . Edit automata: Enforcement mechanisms for run-time security policies. Tech. Rep. TR-681-03 , Princeton University, Princeton, New Jersey . May.]] Ligatti, J., Bauer, L., and Walker, D. 2003. Edit automata: Enforcement mechanisms for run-time security policies. Tech. Rep. TR-681-03, Princeton University, Princeton, New Jersey. May.]]"},{"key":"e_1_2_1_15_1","volume-title":"Tech. Rep. TR-720-05","author":"Ligatti J.","year":"2005","unstructured":"Ligatti , J. , Bauer , L. , and Walker , D . 2005 . Enforcing non-safety security policies with program monitors. Tech. Rep. TR-720-05 , Princeton University, Princeton, New Jersey . January.]] Ligatti, J., Bauer, L., and Walker, D. 2005. Enforcing non-safety security policies with program monitors. Tech. Rep. TR-720-05, Princeton University, Princeton, New Jersey. January.]]"},{"key":"e_1_2_1_16_1","unstructured":"Lindholm T. and Yellin F. 1999. The Java#8482; Virtual Machine Specification second ed. Addison-Wesley.]]   Lindholm T. and Yellin F. 1999. The Java#8482; Virtual Machine Specification second ed. Addison-Wesley.]]"},{"key":"e_1_2_1_17_1","volume-title":"Second Franconia Workshop on Foundations of Computer Security, June 11--14","author":"Marcus L.","year":"1989","unstructured":"Marcus , L. Fall 1989 . The search for a unifying framework for computer security. IEEE Cipher, 55--63. Invited Panel Discussion Position Paper , Second Franconia Workshop on Foundations of Computer Security, June 11--14 , 1989.]] Marcus, L. Fall 1989. The search for a unifying framework for computer security. IEEE Cipher, 55--63. Invited Panel Discussion Position Paper, Second Franconia Workshop on Foundations of Computer Security, June 11--14, 1989.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 26th ACM Symposium on Principles of Programming Languages","author":"Myers A. C.","year":"1999","unstructured":"Myers , A. C. 1999 . Practical mostly-static information flow control . In Proceedings of the 26th ACM Symposium on Principles of Programming Languages . San Antonio, Texas, 228--241.]] 10.1145\/292540.292561 Myers, A. C. 1999. Practical mostly-static information flow control. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages. San Antonio, Texas, 228--241.]] 10.1145\/292540.292561"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/242857.242869"},{"key":"e_1_2_1_21_1","volume-title":"Proof-Carrying Code. In 24th ACM Symposium on Principles of Programming Languages","author":"Necula G.","year":"1997","unstructured":"Necula , G. 1997 . Proof-Carrying Code. In 24th ACM Symposium on Principles of Programming Languages . Paris, France, 106--119.]] 10.1145\/263699.263712 Necula, G. 1997. Proof-Carrying Code. In 24th ACM Symposium on Principles of Programming Languages. Paris, France, 106--119.]] 10.1145\/263699.263712"},{"key":"e_1_2_1_22_1","volume-title":"Second Symposium on Operating Systems Design and Implementation (OSDI '96)","author":"Necula G. C.","unstructured":"Necula , G. C. and Lee , P . 1996. Safe kernel extensions without run-time checking . In Second Symposium on Operating Systems Design and Implementation (OSDI '96) . USENIX, Berkeley, CA, USA, 229--243.]] 10.1145\/238721.238781 Necula, G. C. and Lee, P. 1996. Safe kernel extensions without run-time checking. In Second Symposium on Operating Systems Design and Implementation (OSDI '96). USENIX, Berkeley, CA, USA, 229--243.]] 10.1145\/238721.238781"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 333--344","author":"Necula G. C.","unstructured":"Necula , G. C. and Lee , P . 1998. The design and implementation of a certifying compiler . In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 333--344 .]] 10.1145\/277650.277752 Necula, G. C. and Lee, P. 1998. The design and implementation of a certifying compiler. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 333--344.]] 10.1145\/277650.277752"},{"key":"e_1_2_1_24_1","volume-title":"Computational Complexity","author":"Papadimitriou C. H.","unstructured":"Papadimitriou , C. H. 1995. Computational Complexity . Addison-Wesley .]] Papadimitriou, C. H. 1995. Computational Complexity. Addison-Wesley.]]"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/382130.382133"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-48443-4_6","article-title":"Non-functional policies","volume":"1616","author":"Robben W.","year":"1999","unstructured":"Robben , W. , Vanhaute , B. , Joosen , W. , and Verbaeten , P. 1999 . Non-functional policies . Lecture Notes in Computer Science 1616 , 74 -- 92 .]] Robben, W., Vanhaute, B., Joosen, W., and Verbaeten, P. 1999. Non-functional policies. Lecture Notes in Computer Science 1616, 74--92.]]","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/353323.353382"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the Third USENIX Conference on Object-Oriented Technologies","author":"Small C.","year":"1997","unstructured":"Small , C. 1997 . MiSFIT: A tool for constructing safe extensible C&plus;&plus; systems . In Proceedings of the Third USENIX Conference on Object-Oriented Technologies . Portland, Oregon.]] Small, C. 1997. MiSFIT: A tool for constructing safe extensible C&plus;&plus; systems. In Proceedings of the Third USENIX Conference on Object-Oriented Technologies. Portland, Oregon.]]"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the London Mathematical Society.","volume":"2","author":"Turing A. M.","year":"1936","unstructured":"Turing , A. M. 1936 . On computable numbers with an application to the Entscheidungs-problem . In Proceedings of the London Mathematical Society. vol. 2 . 42, 230--265.]] Turing, A. M. 1936. On computable numbers with an application to the Entscheidungs-problem. In Proceedings of the London Mathematical Society. vol. 2. 42, 230--265.]]"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 14th ACM Symposium on Operating Systems Principles. 203--216","author":"Wahbe R.","unstructured":"Wahbe , R. , Lucco , S. , Anderson , T. E. , and Graham , S. L . 1993. Efficient software-based fault isolation . In Proceedings of the 14th ACM Symposium on Operating Systems Principles. 203--216 .]] 10.1145\/168619.168635 Wahbe, R., Lucco, S., Anderson, T. E., and Graham, S. L. 1993. Efficient software-based fault isolation. In Proceedings of the 14th ACM Symposium on Operating Systems Principles. 203--216.]] 10.1145\/168619.168635"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111596.1111601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111596.1111601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:24Z","timestamp":1750262904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111596.1111601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["10.1145\/1111596.1111601"],"URL":"https:\/\/doi.org\/10.1145\/1111596.1111601","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]},"assertion":[{"value":"2006-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}