{"id":"https://openalex.org/W4310496920","doi":"https://doi.org/10.1145/3563768.3564119","title":"Composing Linear Types and Separation Logic Proofs of Memory Safety","display_name":"Composing Linear Types and Separation Logic Proofs of Memory Safety","publication_year":2022,"publication_date":"2022-11-29","ids":{"openalex":"https://openalex.org/W4310496920","doi":"https://doi.org/10.1145/3563768.3564119"},"language":"en","primary_location":{"id":"doi:10.1145/3563768.3564119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3563768.3564119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040602344","display_name":"Pilar Selene Linares Ar\u00e9valo","orcid":"https://orcid.org/0000-0001-8884-618X"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Pilar Selene Linares Ar\u00e9valo","raw_affiliation_strings":["University of Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040602344"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.120965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"11","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.7944675087928772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6947706341743469},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6798225045204163},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5298866033554077},{"id":"https://openalex.org/keywords/memory-safety","display_name":"Memory safety","score":0.4582911729812622},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4361538589000702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20012804865837097},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.0898192822933197}],"concepts":[{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.7944675087928772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6947706341743469},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6798225045204163},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5298866033554077},{"id":"https://openalex.org/C28180684","wikidata":"https://www.wikidata.org/wiki/Q4080983","display_name":"Memory safety","level":3,"score":0.4582911729812622},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4361538589000702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20012804865837097},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0898192822933197},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3563768.3564119","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3563768.3564119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2137628566","https://openalex.org/W2912106379","https://openalex.org/W2963709481","https://openalex.org/W3174107386","https://openalex.org/W3210291382","https://openalex.org/W4206730944","https://openalex.org/W6758589049"],"related_works":["https://openalex.org/W2165970356","https://openalex.org/W4232666937","https://openalex.org/W2130970533","https://openalex.org/W2620046709","https://openalex.org/W2963709481","https://openalex.org/W2169037418","https://openalex.org/W4250270300","https://openalex.org/W4387674148","https://openalex.org/W1922844761","https://openalex.org/W2913100775"],"abstract_inverted_index":{"Separation":[0],"logic":[1,78],"and":[2,49,76,120],"linear":[3,74],"types":[4,48,75],"are":[5],"two":[6],"formal":[7],"techniques":[8],"for":[9],"reasoning":[10],"about":[11],"the":[12,23,40,43,50,53,69,108,116,123,128],"memory":[13,19,57,81,109],"safety":[14,58,82,110],"of":[15,25,42,52,80,89,111,113],"programs":[16],"with":[17],"manual":[18],"management.":[20],"To":[21],"obtain":[22],"advantages":[24],"both":[26],"methods":[27],"when":[28],"proving":[29,107],"that":[30,90,98,101,127],"a":[31,56,96,102],"program":[32,103,130],"is":[33,104,131],"memory-safe,":[34],"we":[35],"investigate":[36,68],"how":[37],"to":[38,67,94,125],"unify":[39],"notion":[41,51],"frame":[44,54],"from":[45,55],"lin-":[46],"ear":[47],"characterisation":[59],"inspired":[60],"by":[61,106],"separation":[62,77],"logic.":[63],"That":[64],"allows":[65],"us":[66],"necessary":[70],"conditions":[71],"under":[72],"which":[73],"proofs":[79,124],"may":[83],"be":[84,93],"successfully":[85],"composed.":[86],"The":[87],"benefit":[88],"composition":[91],"would":[92],"design":[95],"framework":[97],"supports":[99],"verifying":[100],"memory-safe":[105],"parts":[112],"it":[114],"using":[115],"more":[117],"appropriate":[118],"technique":[119],"then":[121],"composing":[122],"certify":[126],"entire":[129],"safe.":[132]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}