<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1464201> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/title> "Layered graph logic as an assertion language for access control policy models"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/abstract> "We describe a uniform logical framework, based on a bunched logic that combines classical additives and very weak multiplicatives, for reasoning compositionally about access control policy models. We show how our approach takes account of the underlying system architecture, and so provides a way to identify and reason about how vulnerabilities may arise (and be removed) as a result of the architecture of the system. We consider, using frame rules, how local properties of access control policies are maintained as the system architecture evolves."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/date> "2015-06-12" .
<https://discovery.ucl.ac.uk/id/document/72395> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/volume> "27" .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/issue> "1" .
<https://discovery.ucl.ac.uk/id/org/ext-daeb92daf570917684167066877da0ed> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://discovery.ucl.ac.uk/id/org/ext-daeb92daf570917684167066877da0ed> <http://xmlns.com/foaf/0.1/name> "Oxford University Press (OUP)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/publisher> <https://discovery.ucl.ac.uk/id/org/ext-daeb92daf570917684167066877da0ed> .
<https://discovery.ucl.ac.uk/id/publication/ext-1465363X> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-1465363X> <http://xmlns.com/foaf/0.1/name> "Journal of Logic and Computation"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-1465363X> .
<https://discovery.ucl.ac.uk/id/publication/ext-1465363X> <http://www.w3.org/2002/07/owl#sameAs> <urn:issn:1465363X> .
<https://discovery.ucl.ac.uk/id/publication/ext-1465363X> <http://purl.org/ontology/bibo/issn> "1465363X" .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1464201#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1464201#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1464201#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1464201#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/1464201#authors> .
<https://discovery.ucl.ac.uk/id/eprint/1464201#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> .
<https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> <http://xmlns.com/foaf/0.1/givenName> "M"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> <http://xmlns.com/foaf/0.1/familyName> "Collinson"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-7175219d422a9f036ee46798548d39e5> <http://xmlns.com/foaf/0.1/name> "M Collinson"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> <http://xmlns.com/foaf/0.1/givenName> "K"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> <http://xmlns.com/foaf/0.1/familyName> "McDonald"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-adf40f310ac4269b33a5d105232f29e6> <http://xmlns.com/foaf/0.1/name> "K McDonald"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> <http://xmlns.com/foaf/0.1/givenName> "D"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> <http://xmlns.com/foaf/0.1/familyName> "Pym"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-cbd0d802a1a6ec2a9f6a8118e7c16542> <http://xmlns.com/foaf/0.1/name> "D Pym"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/72395> .
<https://discovery.ucl.ac.uk/id/document/72395> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/72395> <http://www.w3.org/2000/01/rdf-schema#label> "Layered graph logic as an assertion language for access control policy models (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/72395> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/1464201/1/CollinsonMcDonaldPym-AccessControl.pdf> .
<https://discovery.ucl.ac.uk/id/document/72395> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/1464201/1/CollinsonMcDonaldPym-AccessControl.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/1464201/1/CollinsonMcDonaldPym-AccessControl.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "CollinsonMcDonaldPym-AccessControl.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/127537> .
<https://discovery.ucl.ac.uk/id/document/127537> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/127537> <http://www.w3.org/2000/01/rdf-schema#label> "Layered graph logic as an assertion language for access control policy models (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/127537> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/72395> .
<https://discovery.ucl.ac.uk/id/document/127537> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/72395> .
<https://discovery.ucl.ac.uk/id/document/127537> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/72395> .
<https://discovery.ucl.ac.uk/id/eprint/1464201> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/1464201/> .
<https://discovery.ucl.ac.uk/id/eprint/1464201/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #1464201 \n\nLayered graph logic as an assertion language for access control policy models\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/1464201/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/1464201/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/1464201> .