{"id":"https://openalex.org/W4205402745","doi":"https://doi.org/10.1145/3498662","title":"Connectivity graphs: a method for proving deadlock freedom based on separation logic","display_name":"Connectivity graphs: a method for proving deadlock freedom based on separation logic","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4205402745","doi":"https://doi.org/10.1145/3498662"},"language":"en","primary_location":{"id":"doi:10.1145/3498662","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498662","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498662","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3498662","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066303700","display_name":"Jules Jacobs","orcid":"https://orcid.org/0000-0003-1976-3182"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jules Jacobs","raw_affiliation_strings":["Radboud University Nijmegen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083850156","display_name":"Stephanie Balzer","orcid":"https://orcid.org/0000-0002-8347-3529"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephanie Balzer","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029418370","display_name":"Robbert Krebbers","orcid":"https://orcid.org/0000-0002-1185-5237"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robbert Krebbers","raw_affiliation_strings":["Radboud University Nijmegen, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1185-5237","affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066303700"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":2.081,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8848172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"6","issue":"POPL","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7170681953430176},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.7133097052574158},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6182583570480347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5658714175224304},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5262072682380676},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4594500958919525},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41248300671577454},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2496517300605774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22692564129829407},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10357773303985596},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09745898842811584}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7170681953430176},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.7133097052574158},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6182583570480347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5658714175224304},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5262072682380676},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4594500958919525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41248300671577454},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2496517300605774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22692564129829407},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10357773303985596},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09745898842811584},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3498662","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498662","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498662","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/241515","is_oa":false,"landing_page_url":"https://repository.ubn.ru.nl/handle/2066/241515","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/241515","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/241515","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages, 6, 1 - 33","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3498662","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498662","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498662","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.699999988079071}],"awards":[{"id":"https://openalex.org/G7824405778","display_name":"SHF:Small: Enriching Session Types for Practical Concurrent Programming","funder_award_id":"1718267","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4205402745.pdf","grobid_xml":"https://content.openalex.org/works/W4205402745.grobid-xml"},"referenced_works_count":89,"referenced_works":["https://openalex.org/W34985553","https://openalex.org/W53839316","https://openalex.org/W62586952","https://openalex.org/W776882319","https://openalex.org/W1483047125","https://openalex.org/W1495368328","https://openalex.org/W1509279433","https://openalex.org/W1516360493","https://openalex.org/W1537467263","https://openalex.org/W1547651002","https://openalex.org/W1549121707","https://openalex.org/W1557561422","https://openalex.org/W1560340731","https://openalex.org/W1607623316","https://openalex.org/W1653213632","https://openalex.org/W1784055113","https://openalex.org/W1941373452","https://openalex.org/W1971043428","https://openalex.org/W1972836343","https://openalex.org/W1980939032","https://openalex.org/W1993460177","https://openalex.org/W2008132476","https://openalex.org/W2017487418","https://openalex.org/W2040105559","https://openalex.org/W2042360145","https://openalex.org/W2046488919","https://openalex.org/W2054150540","https://openalex.org/W2054670810","https://openalex.org/W2061637869","https://openalex.org/W2063818704","https://openalex.org/W2080718905","https://openalex.org/W2081058753","https://openalex.org/W2109568634","https://openalex.org/W2124126159","https://openalex.org/W2147323041","https://openalex.org/W2153557668","https://openalex.org/W2154581630","https://openalex.org/W2169668980","https://openalex.org/W2244156369","https://openalex.org/W2293728411","https://openalex.org/W2402424078","https://openalex.org/W2422824912","https://openalex.org/W2514073179","https://openalex.org/W2517371102","https://openalex.org/W2555837147","https://openalex.org/W2562833768","https://openalex.org/W2581223864","https://openalex.org/W2736821074","https://openalex.org/W2753352514","https://openalex.org/W2756128776","https://openalex.org/W2779850521","https://openalex.org/W2797550608","https://openalex.org/W2797766638","https://openalex.org/W2885030506","https://openalex.org/W2888816318","https://openalex.org/W2889218563","https://openalex.org/W2899725893","https://openalex.org/W2901454403","https://openalex.org/W2918427073","https://openalex.org/W2933941175","https://openalex.org/W2963481060","https://openalex.org/W2963595697","https://openalex.org/W2972991068","https://openalex.org/W2975389957","https://openalex.org/W2994908035","https://openalex.org/W3002954820","https://openalex.org/W3014307583","https://openalex.org/W3016508576","https://openalex.org/W3081329131","https://openalex.org/W3094781589","https://openalex.org/W3100105801","https://openalex.org/W3103377061","https://openalex.org/W3103866264","https://openalex.org/W3114038009","https://openalex.org/W3122350614","https://openalex.org/W3132401016","https://openalex.org/W3147375852","https://openalex.org/W3149940773","https://openalex.org/W3151288834","https://openalex.org/W3173862082","https://openalex.org/W3175560211","https://openalex.org/W3176096829","https://openalex.org/W3194485154","https://openalex.org/W3195431916","https://openalex.org/W3198885441","https://openalex.org/W4205402745","https://openalex.org/W4213249360","https://openalex.org/W4302984605","https://openalex.org/W6893793464"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2495367456","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W4247835804","https://openalex.org/W4205402745"],"abstract_inverted_index":{"We":[0,56,123],"introduce":[1,114],"the":[2,12,64,105,141],"notion":[3],"of":[4,11,14,25,66,104,145],"a":[5,75,115,134],"connectivity":[6,81,106,121],"graph":[7,82,99],"\u2014an":[8],"abstract":[9],"representation":[10],"topology":[13],"concurrently":[15],"interacting":[16],"entities,":[17],"which":[18],"allows":[19],"us":[20],"to":[21,79,139],"encapsulate":[22],"generic":[23,93],"principles":[24],"reasoning":[26],"about":[27],"deadlock":[28,58,146],"freedom":[29,62],".":[30],"Connectivity":[31],"graphs":[32],"are":[33],"parametric":[34],"in":[35,63,127],"their":[36,45],"vertices":[37],"(representing":[38,47,53],"entities":[39],"like":[40],"threads":[41],"and":[42,44,59,68,70,84,129,147],"channels)":[43],"edges":[46,83],"references":[48],"between":[49],"entities)":[50],"with":[51,133],"labels":[52,85],"interaction":[54],"protocols).":[55],"prove":[57,88,109],"memory":[60],"leak":[61,148],"style":[65],"progress":[67,111],"preservation":[69,89],"use":[71],"separation":[72,94],"logic":[73,95],"as":[74],"meta":[76],"theoretic":[77],"tool":[78],"treat":[80],"substructurally.":[86],"To":[87,108],"locally,":[90,112],"we":[91,113],"distill":[92],"rules":[96],"for":[97,119],"local":[98],"transformations":[100],"that":[101],"preserve":[102],"acyclicity":[103],"graph.":[107],"global":[110],"waiting":[116],"induction":[117],"principle":[118],"acyclic":[120],"graphs.":[122],"mechanize":[124],"our":[125,131],"results":[126],"Coq,":[128],"instantiate":[130],"method":[132],"higher-order":[135],"binary":[136],"session-typed":[137],"language":[138],"obtain":[140],"first":[142],"mechanized":[143],"proof":[144],"freedom.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}