{"id":"https://openalex.org/W4384471589","doi":"https://doi.org/10.1007/978-3-031-37706-8_6","title":"Commutativity for\u00a0Concurrent Program Termination Proofs","display_name":"Commutativity for\u00a0Concurrent Program Termination Proofs","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4384471589","doi":"https://doi.org/10.1007/978-3-031-37706-8_6"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-37706-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_6.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035188548","display_name":"Danya Lette","orcid":"https://orcid.org/0000-0002-3929-7521"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Danya Lette","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0002-3929-7521","affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016276143","display_name":"Azadeh Farzan","orcid":"https://orcid.org/0000-0001-9005-2653"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Azadeh Farzan","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9005-2653","affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035188548"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.5607,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.83900981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"109","last_page":"131"},"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.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/T10126","display_name":"Logic, programming, and type systems","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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8171138763427734},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.8133367300033569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7379967570304871},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6414471864700317},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6204370260238647},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5585828423500061},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.5200623869895935},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5023112297058105},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4944634437561035},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4454626441001892},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42880815267562866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41401660442352295},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3206169009208679},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18243378400802612}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8171138763427734},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.8133367300033569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7379967570304871},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6414471864700317},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6204370260238647},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5585828423500061},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.5200623869895935},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5023112297058105},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4944634437561035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4454626441001892},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42880815267562866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41401660442352295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3206169009208679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18243378400802612},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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.1007/978-3-031-37706-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-37706-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37706-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37706-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4384471589.pdf"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W48672996","https://openalex.org/W182717014","https://openalex.org/W221832247","https://openalex.org/W286513891","https://openalex.org/W818447237","https://openalex.org/W1499072146","https://openalex.org/W1529497146","https://openalex.org/W1542502949","https://openalex.org/W1569234295","https://openalex.org/W1573651116","https://openalex.org/W1594530072","https://openalex.org/W1875182499","https://openalex.org/W1968428133","https://openalex.org/W1989813138","https://openalex.org/W2072062729","https://openalex.org/W2143665015","https://openalex.org/W2145062333","https://openalex.org/W2155487709","https://openalex.org/W2883180298","https://openalex.org/W2900035213","https://openalex.org/W2962297646","https://openalex.org/W2963088485","https://openalex.org/W2985800447","https://openalex.org/W2995623611","https://openalex.org/W3033402562","https://openalex.org/W3108936444","https://openalex.org/W3117154651","https://openalex.org/W3139745505","https://openalex.org/W3139951540","https://openalex.org/W3166575995","https://openalex.org/W3207298678","https://openalex.org/W4240322748","https://openalex.org/W4246691913","https://openalex.org/W4248689402","https://openalex.org/W4281968516","https://openalex.org/W4315606532"],"related_works":["https://openalex.org/W1511249877","https://openalex.org/W1578828174","https://openalex.org/W2950376466","https://openalex.org/W2000943029","https://openalex.org/W2621980927","https://openalex.org/W2002878601","https://openalex.org/W2199396573","https://openalex.org/W4302559785","https://openalex.org/W2140496290","https://openalex.org/W2462966030"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"explores":[3],"how":[4],"using":[5],"commutativity":[6,101],"can":[7,27],"improve":[8],"the":[9,50,52,76,123],"efficiency":[10],"and":[11,106],"efficacy":[12],"of":[13,49,110,125],"algorithmic":[14],"termination":[15,43,131],"checking":[16,132],"for":[17,55,133],"concurrent":[18,134],"programs.":[19,135],"If":[20],"a":[21,56,89,108],"program":[22,57],"run":[23,58],"is":[24],"terminating,":[25],"one":[26],"conclude":[28],"that":[29,74,79,121],"all":[30],"other":[31],"runs":[32],"equivalent":[33],"to":[34],"it":[35],"up-to-commutativity":[36],"are":[37],"also":[38],"terminating.":[39],"Since":[40],"reasoning":[41,45,103],"about":[42,46,104],"involves":[44],"infinite":[47,61],"behaviours":[48],"program,":[51],"equivalence":[53],"class":[54],"may":[59,82],"include":[60],"words":[62],"with":[63],"lengths":[64],"strictly":[65],"larger":[66],"than":[67],"$$\\omega":[68],"$$":[69],"<mml:math":[70],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[71],"<mml:mi>\u03c9</mml:mi>":[72],"</mml:math>":[73],"capture":[75],"intuitive":[77],"notion":[78],"some":[80],"actions":[81],"soundly":[83],"be":[84],"postponed":[85],"indefinitely.":[86],"We":[87,117],"propose":[88],"sound":[90,114],"proof":[91,115],"rule":[92],"which":[93],"exploits":[94],"these":[95],"as":[96,98],"well":[97],"classic":[99],"bounded":[100],"in":[102,128],"termination,":[105],"devise":[107],"way":[109],"algorithmically":[111],"implementing":[112],"this":[113,126],"rule.":[116],"present":[118],"experimental":[119],"results":[120],"demonstrate":[122],"effectiveness":[124],"method":[127],"improving":[129],"automated":[130]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-21T23:30:37.877113","created_date":"2025-10-10T00:00:00"}