{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/67641"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/67641","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Semantics for Secure Software","abstract":"In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies.","abstract_html":"In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies.","abstract_has_math":false,"creators":["Hirsch, Andrew Karl"],"institution":"Cornell University","degree_name":"Ph.D., Computer Science","degree_level":"Doctor of Philosophy","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Tate, Ross Everett"],"committee_members":["Kozen, Dexter Campbell","Shore, Richard A.","Morrisett, John Gregory"],"year":2019,"date_issued":"2019-08-30","date_published":"2019-08-30","updated_at":"2026-11-19T03:20:50Z","subjects":["authorization","Logic","Comonad","Flow-Limited Authorization","Monad","Computer science","Programming Languages"],"languages":["en_US"],"rights":["Attribution 4.0 International"],"rights_urls":["https://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/6grg-xc95"],"render_values":[{"text":"https://doi.org/10.7298/6grg-xc95","href":"https://doi.org/10.7298/6grg-xc95","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050625"],"render_values":[{"text":"11050625","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11681","ProQuest Publication ID: 22615741"],"render_values":[{"text":"ProQuest Submission ID: 11681","href":null,"code":true},{"text":"ProQuest Publication ID: 22615741","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/67641","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/67641","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F67641","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Tate, Ross Everett"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Kozen, Dexter Campbell","Shore, Richard A.","Morrisett, John Gregory"]},{"key":"dc:creator","label":"Author","values":["Hirsch, Andrew Karl"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-10-15T16:49:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-15T16:49:13Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-08-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D., Computer Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["authorization","Logic","Comonad","Flow-Limited Authorization","Monad","Computer science","Programming Languages"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050625"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/6grg-xc95"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11681","ProQuest Publication ID: 22615741"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/67641"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"38de4f24-498f-4b6d-b87b-b00c0f8c92e1\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Semantics for Secure Software</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-08-30</PublicationDate> <DOI>https://doi.org/10.7298/6grg-xc95</DOI> <Authors> <Author> <DisplayName>Hirsch, Andrew Karl</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>authorization</Keyword> <Keyword>Logic</Keyword> <Keyword>Comonad</Keyword> <Keyword>Flow-Limited Authorization</Keyword> <Keyword>Monad</Keyword> <Keyword>Computer science</Keyword> <Keyword>Programming Languages</Keyword> <Abstract>In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Hirsch, Andrew Karl"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["Supplemental file(s) description: Coq Code for FOCAL, Coq code for FLAFOL"]},{"key":"dc:description.abstract","label":"Abstract","values":["In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf","application/zip"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["Semantics for Secure Software"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"38de4f24-498f-4b6d-b87b-b00c0f8c92e1\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Semantics for Secure Software</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-08-30</PublicationDate> <DOI>https://doi.org/10.7298/6grg-xc95</DOI> <Authors> <Author> <DisplayName>Hirsch, Andrew Karl</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>authorization</Keyword> <Keyword>Logic</Keyword> <Keyword>Comonad</Keyword> <Keyword>Flow-Limited Authorization</Keyword> <Keyword>Monad</Keyword> <Keyword>Computer science</Keyword> <Keyword>Programming Languages</Keyword> <Abstract>In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Hirsch, Andrew Karl"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Tate, Ross Everett"],"dc:contributor.committeemember":["Kozen, Dexter Campbell","Shore, Richard A.","Morrisett, John Gregory"],"dc:creator":["Hirsch, Andrew Karl"],"dc:date.accessioned":["2019-10-15T16:49:13Z"],"dc:date.available":["2019-10-15T16:49:13Z"],"dc:date.issued":["2019-08-30"],"dc:description":["Supplemental file(s) description: Coq Code for FOCAL, Coq code for FLAFOL"],"dc:description.abstract":["In order to build machine-checked proven-secure software, we need formal se curity policies that express what it means to be “secure.” We must then show that the semantics of our software matches the semantics of those policies. This requires formal semantics for both programs and policies. In this dissertation, we explore the semantics of effectful programs and the semantics of authorization policies. The most well-known class of effects are those that can be given semantics via a monad, though current research also focuses on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the first method exists then the three semantics are equivalent. Otherwise, we show that the two remaining semantics correspond to strict and lazy interpretations of the effects. On the other side, we use authorization logics to express authorization policies. Authorization logics can be given semantics using either models or a proof system. We build a model theory for an authorization logic that more-closely expresses how authorization logics are used by systems than traditional models. We also build a proof system for an authorization logic that ensures that proofs of authorization respect information-security policies."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf","application/zip"],"dc:identifier.bibid":["11050625"],"dc:identifier.doi":["https://doi.org/10.7298/6grg-xc95"],"dc:identifier.other":["ProQuest Submission ID: 11681","ProQuest Publication ID: 22615741"],"dc:identifier.uri":["https://hdl.handle.net/1813/67641"],"dc:language.iso":["en_US"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["https://creativecommons.org/licenses/by/4.0/"],"dc:subject":["authorization","Logic","Comonad","Flow-Limited Authorization","Monad","Computer science","Programming Languages"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["Semantics for Secure Software"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph.D., Computer Science"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:50Z"}