<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T10:42:52Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/5302" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/5302</identifier><datestamp>2026-05-14T13:54:58Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Weissman, Victoria Rebecca</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-02-08T15:12:54Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-02-08T07:29:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-02-08T15:12:54Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/5302</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476271</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">An authorization policy states the conditions under which an action is&#xd;
permitted or forbidden.  In this dissertation, we use formal methods&#xd;
to ensure that policies written in certain languages are unambiguous&#xd;
and to provide provably correct algorithms for reasoning about&#xd;
policies.  For example, we describe how questions about entailment,&#xd;
such as ``may Alice edit the database?'', can be answered efficiently.&#xd;
&#xd;
We begin by showing that a fragment of first-order logic can be used&#xd;
to represent and reason about policies.  Because we use first-order&#xd;
logic, policies have a clear syntax and semantics.  We show that&#xd;
further restricting the fragment results in a language that is still&#xd;
quite expressive yet is also tractable.  More precisely, questions&#xd;
about entailment can be answered in time that is a low-order&#xd;
polynomial (indeed, almost linear in some cases), as can questions&#xd;
about the consistency of policy sets.&#xd;
&#xd;
In addition to developing our own language, we have examined two&#xd;
policy languages, XrML and ODRL.  We focused on these languages&#xd;
because, when we began our work, they seemed to have the strongest&#xd;
support from industry.  We found that the specifications for both&#xd;
languages have significant problems, which is not surprising since&#xd;
neither includes formal semantics.  We discussed the problems that we&#xd;
found with the language developers and then proposed formal semantics&#xd;
for each language.  We present our semantics here.  In addition, we&#xd;
consider the complexity of determining if a permission is implied by a&#xd;
set of statements in each language.  We prove that the general problem&#xd;
for XrML is undecidable and the general problem for ODRL is decidable&#xd;
and NP-hard.  Finally, we define fragments of both languages that are&#xd;
fairly expressive and for which the problem is polynomial-time&#xd;
computable.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">747883 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">logic</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">security</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Reasoning about Authorization Policies</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Weissman, Victoria Rebecca</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e3a55db7-3c43-4275-b883-be30bc018558">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Reasoning about Authorization Policies&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007-02-08T15:12:54Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Weissman, Victoria Rebecca&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>logic&lt;/Keyword>
    &lt;Keyword>security&lt;/Keyword>
   	&lt;Abstract>An authorization policy states the conditions under which an action is&#xd;
permitted or forbidden.  In this dissertation, we use formal methods&#xd;
to ensure that policies written in certain languages are unambiguous&#xd;
and to provide provably correct algorithms for reasoning about&#xd;
policies.  For example, we describe how questions about entailment,&#xd;
such as ``may Alice edit the database?&amp;apos;&amp;apos;, can be answered efficiently.&#xd;
&#xd;
We begin by showing that a fragment of first-order logic can be used&#xd;
to represent and reason about policies.  Because we use first-order&#xd;
logic, policies have a clear syntax and semantics.  We show that&#xd;
further restricting the fragment results in a language that is still&#xd;
quite expressive yet is also tractable.  More precisely, questions&#xd;
about entailment can be answered in time that is a low-order&#xd;
polynomial (indeed, almost linear in some cases), as can questions&#xd;
about the consistency of policy sets.&#xd;
&#xd;
In addition to developing our own language, we have examined two&#xd;
policy languages, XrML and ODRL.  We focused on these languages&#xd;
because, when we began our work, they seemed to have the strongest&#xd;
support from industry.  We found that the specifications for both&#xd;
languages have significant problems, which is not surprising since&#xd;
neither includes formal semantics.  We discussed the problems that we&#xd;
found with the language developers and then proposed formal semantics&#xd;
for each language.  We present our semantics here.  In addition, we&#xd;
consider the complexity of determining if a permission is implied by a&#xd;
set of statements in each language.  We prove that the general problem&#xd;
for XrML is undecidable and the general problem for ODRL is decidable&#xd;
and NP-hard.  Finally, we define fragments of both languages that are&#xd;
fairly expressive and for which the problem is polynomial-time&#xd;
computable.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>