{"id":"https://openalex.org/W4403223009","doi":"https://doi.org/10.1145/3689784","title":"Automated Verification of Parametric Channel-Based Process Communication","display_name":"Automated Verification of Parametric Channel-Based Process Communication","publication_year":2024,"publication_date":"2024-10-08","ids":{"openalex":"https://openalex.org/W4403223009","doi":"https://doi.org/10.1145/3689784"},"language":"en","primary_location":{"id":"doi:10.1145/3689784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689784","pdf_url":null,"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://doi.org/10.1145/3689784","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035782346","display_name":"Georgian-Vlad Saioc","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Georgian-Vlad Saioc","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0009-0000-1714-3866","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018974160","display_name":"Julien Lange","orcid":"https://orcid.org/0000-0001-9697-1378"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Julien Lange","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-9697-1378","affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103189175","display_name":"Anders M\u00f8ller","orcid":"https://orcid.org/0000-0003-1333-2314"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Anders M\u00f8ller","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1333-2314","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035782346"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.6658,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7335795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"8","issue":"OOPSLA2","first_page":"2070","last_page":"2096"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9984999895095825,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8566769361495972},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7884527444839478},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7498825788497925},{"id":"https://openalex.org/keywords/precondition","display_name":"Precondition","score":0.6992493867874146},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6166447997093201},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5801740884780884},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5122467875480652},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4972391426563263},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48187050223350525},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4325946867465973},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3297324776649475},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14063772559165955}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8566769361495972},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7884527444839478},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7498825788497925},{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.6992493867874146},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6166447997093201},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5801740884780884},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5122467875480652},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4972391426563263},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48187050223350525},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4325946867465973},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3297324776649475},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14063772559165955},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3689784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689784","pdf_url":null,"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:pure.atira.dk:openaire/c7527446-03ef-4983-b4cc-5272ecbe0fb0","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85206890223","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Saioc, G-V, Lange, J & M\u00f8ller, A 2024, Automated Verification of Parametric Channel-Based Process Communication. in Proceedings of the ACM on Programming Languages. vol. 8, 344, Proceedings of the ACM on Programming Languages , no. OOPSLA2, vol. 8, pp. 2070-2096. https://doi.org/10.1145/3689784","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/c7527446-03ef-4983-b4cc-5272ecbe0fb0","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/c7527446-03ef-4983-b4cc-5272ecbe0fb0","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Saioc, G-V, Lange, J & M\u00f8ller, A 2024, Automated Verification of Parametric Channel-Based Process Communication. in Proceedings of the ACM on Programming Languages. vol. 8, 344, Proceedings of the ACM on Programming Languages , no. OOPSLA2, vol. 8, pp. 2070-2096. https://doi.org/10.1145/3689784","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3689784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689784","pdf_url":null,"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":[{"display_name":"Peace, Justice and strong institutions","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W145069693","https://openalex.org/W1510368738","https://openalex.org/W1531054827","https://openalex.org/W1561112849","https://openalex.org/W1563374593","https://openalex.org/W1566132409","https://openalex.org/W1589297860","https://openalex.org/W1606177908","https://openalex.org/W1918351269","https://openalex.org/W2012140001","https://openalex.org/W2110908283","https://openalex.org/W2130427425","https://openalex.org/W2294722445","https://openalex.org/W2296352734","https://openalex.org/W2416392025","https://openalex.org/W2512167970","https://openalex.org/W2564372592","https://openalex.org/W2612667315","https://openalex.org/W2795275488","https://openalex.org/W2811782531","https://openalex.org/W2888816426","https://openalex.org/W2900980898","https://openalex.org/W2921920223","https://openalex.org/W3033229382","https://openalex.org/W3108356375","https://openalex.org/W3138459719","https://openalex.org/W3139412870","https://openalex.org/W3156367898","https://openalex.org/W3183749185","https://openalex.org/W4206838052","https://openalex.org/W4211008702","https://openalex.org/W4214757745","https://openalex.org/W4313563792","https://openalex.org/W4388718082","https://openalex.org/W4392265921","https://openalex.org/W6949141338"],"related_works":["https://openalex.org/W2294916142","https://openalex.org/W1581362285","https://openalex.org/W1988458526","https://openalex.org/W2953046944","https://openalex.org/W2185407019","https://openalex.org/W2368102490","https://openalex.org/W2365256108","https://openalex.org/W2355319912","https://openalex.org/W2391570358","https://openalex.org/W2003908543"],"abstract_inverted_index":{"A":[0],"challenge":[1],"of":[2,12,64,86,174,186],"writing":[3],"concurrent":[4],"message":[5],"passing":[6],"programs":[7,126],"is":[8,58,101,111,139,200],"ensuring":[9],"the":[10,62,69,84,145,172,180,184,203],"absence":[11,85,185],"partial":[13,35,87,131,140,187,210],"deadlocks,":[14],"which":[15],"can":[16,121,154,182],"cause":[17],"severe":[18],"memory":[19],"leaks":[20],"in":[21,37,89,189],"long":[22],"running":[23],"systems.":[24],"Several":[25],"static":[26],"analysis":[27],"techniques":[28,176],"have":[29,177],"been":[30],"proposed":[31],"for":[32],"automatically":[33,82],"detecting":[34],"deadlocks":[36,88,188],"Go":[38,90,104],"programs.":[39],"For":[40,192],"a":[41,78,107,137,151,161,197],"large":[42],"enterprise":[43],"code":[44,163,205],"base,":[45],"we":[46],"found":[47],"these":[48],"tools":[49],"too":[50],"imprecise":[51],"to":[52,81,102,106,114,208],"reason":[53],"about":[54],"process":[55,96],"communication":[56,66,118],"that":[57,110,169,179,202],"parametric,":[59],"i.e.,":[60],"where":[61,136],"number":[63],"channel":[65,70],"operations":[67],"or":[68],"capacities":[71],"are":[72,170],"determined":[73],"at":[74],"runtime.":[75],"We":[76],"present":[77],"novel":[79],"approach":[80,181],"verify":[83,183],"program":[91,167],"fragments":[92,105,168],"with":[93,128],"such":[94],"parametric":[95,117],"communication.":[97],"The":[98],"key":[99],"idea":[100],"translate":[103],"core":[108],"language":[109],"sufficiently":[112],"expressive":[113],"represent":[115],"real-world":[116,162],"patterns":[119],"and":[120],"be":[122,156],"encoded":[123],"into":[124],"Dafny":[125],"annotated":[127],"postconditions":[129],"enforcing":[130],"deadlock":[132,141,211],"freedom.":[133,212],"In":[134],"situations":[135],"fragment":[138],"free":[142],"only":[143],"when":[144],"concurrency":[146],"parameters":[147],"satisfy":[148,207],"certain":[149],"conditions,":[150],"suitable":[152],"precondition":[153,199],"often":[155],"inferred.":[157],"Experimental":[158],"results":[159],"on":[160],"base":[164],"containing":[165],"583":[166],"beyond":[171],"reach":[173],"existing":[175],"shown":[178],"145":[190],"cases.":[191],"an":[193],"additional":[194],"228":[195],"cases,":[196],"nontrivial":[198],"inferred":[201],"surrounding":[204],"must":[206],"ensure":[209]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}