Computability classes for enforcement mechanisms
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 polic...
Gespeichert in:
Veröffentlicht in: | ACM transactions on programming languages and systems 2006, Vol.28 (1), p.175-205 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 205 |
---|---|
container_issue | 1 |
container_start_page | 175 |
container_title | ACM transactions on programming languages and systems |
container_volume | 28 |
creator | HAMLEN, Kevin W MORRISETT, Greg SCHNEIDER, Fred B |
description | 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. |
doi_str_mv | 10.1145/1111596.1111601 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28856154</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28856154</sourcerecordid><originalsourceid>FETCH-LOGICAL-c370t-a556471bafe32326d3e8d0f89f029c7d26ac178c4458dee2163565d905f659c13</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhYMoWKtrt4Ogu2lzk9w8llJ8QcGNrkOaSXDKPGoys-i_d6QDgndxzuY7h8sh5BboCkDgGqZDI1e_LimckQUg6lKg4edkQUGKkhqGl-Qq5z2lFDTqBaGbvj2Mg9vVTT0cC9-4nEMuYp-K0E3qQxu6oWiD_3Jdndt8TS6ia3K4mX1JPp-fPjav5fb95W3zuC09V3QoHaIUCnYuBs44kxUPuqJRm0iZ8api0nlQ2guBugqBgeQosTIUo0TjgS_Jw6n3kPrvMeTBtnX2oWlcF_oxW6Y1SkAxgXf_wH0_pm76zTJAxYUSZoLWJ8inPucUoj2kunXpaIHa3_nsPJ-d55sS93Oty941MbnO1_kvpoRmjEn-AxfGbRc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>215734749</pqid></control><display><type>article</type><title>Computability classes for enforcement mechanisms</title><source>ACM Digital Library Complete</source><creator>HAMLEN, Kevin W ; MORRISETT, Greg ; SCHNEIDER, Fred B</creator><creatorcontrib>HAMLEN, Kevin W ; MORRISETT, Greg ; SCHNEIDER, Fred B</creatorcontrib><description>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.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/1111596.1111601</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming languages ; Software</subject><ispartof>ACM transactions on programming languages and systems, 2006, Vol.28 (1), p.175-205</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright Association for Computing Machinery Jan 2006</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c370t-a556471bafe32326d3e8d0f89f029c7d26ac178c4458dee2163565d905f659c13</citedby><cites>FETCH-LOGICAL-c370t-a556471bafe32326d3e8d0f89f029c7d26ac178c4458dee2163565d905f659c13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17482226$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>HAMLEN, Kevin W</creatorcontrib><creatorcontrib>MORRISETT, Greg</creatorcontrib><creatorcontrib>SCHNEIDER, Fred B</creatorcontrib><title>Computability classes for enforcement mechanisms</title><title>ACM transactions on programming languages and systems</title><description>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.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Programming languages</subject><subject>Software</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpdkEtLAzEUhYMoWKtrt4Ogu2lzk9w8llJ8QcGNrkOaSXDKPGoys-i_d6QDgndxzuY7h8sh5BboCkDgGqZDI1e_LimckQUg6lKg4edkQUGKkhqGl-Qq5z2lFDTqBaGbvj2Mg9vVTT0cC9-4nEMuYp-K0E3qQxu6oWiD_3Jdndt8TS6ia3K4mX1JPp-fPjav5fb95W3zuC09V3QoHaIUCnYuBs44kxUPuqJRm0iZ8api0nlQ2guBugqBgeQosTIUo0TjgS_Jw6n3kPrvMeTBtnX2oWlcF_oxW6Y1SkAxgXf_wH0_pm76zTJAxYUSZoLWJ8inPucUoj2kunXpaIHa3_nsPJ-d55sS93Oty941MbnO1_kvpoRmjEn-AxfGbRc</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>HAMLEN, Kevin W</creator><creator>MORRISETT, Greg</creator><creator>SCHNEIDER, Fred B</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2006</creationdate><title>Computability classes for enforcement mechanisms</title><author>HAMLEN, Kevin W ; MORRISETT, Greg ; SCHNEIDER, Fred B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c370t-a556471bafe32326d3e8d0f89f029c7d26ac178c4458dee2163565d905f659c13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Programming languages</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>HAMLEN, Kevin W</creatorcontrib><creatorcontrib>MORRISETT, Greg</creatorcontrib><creatorcontrib>SCHNEIDER, Fred B</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>HAMLEN, Kevin W</au><au>MORRISETT, Greg</au><au>SCHNEIDER, Fred B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computability classes for enforcement mechanisms</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><date>2006</date><risdate>2006</risdate><volume>28</volume><issue>1</issue><spage>175</spage><epage>205</epage><pages>175-205</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><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.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/1111596.1111601</doi><tpages>31</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0164-0925 |
ispartof | ACM transactions on programming languages and systems, 2006, Vol.28 (1), p.175-205 |
issn | 0164-0925 1558-4593 |
language | eng |
recordid | cdi_proquest_miscellaneous_28856154 |
source | ACM Digital Library Complete |
subjects | Applied sciences Computer science control theory systems Exact sciences and technology Programming languages Software |
title | Computability classes for enforcement mechanisms |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T20%3A27%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computability%20classes%20for%20enforcement%20mechanisms&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=HAMLEN,%20Kevin%20W&rft.date=2006&rft.volume=28&rft.issue=1&rft.spage=175&rft.epage=205&rft.pages=175-205&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/1111596.1111601&rft_dat=%3Cproquest_cross%3E28856154%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=215734749&rft_id=info:pmid/&rfr_iscdi=true |