{"id":"https://openalex.org/W4390604697","doi":"https://doi.org/10.1145/3632925","title":"Commutativity Simplifies Proofs of Parameterized Programs","display_name":"Commutativity Simplifies Proofs of Parameterized Programs","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390604697","doi":"https://doi.org/10.1145/3632925"},"language":"en","primary_location":{"id":"doi:10.1145/3632925","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632925","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632925","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/3632925","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089682457","display_name":"Dominik Klumpp","orcid":"https://orcid.org/0000-0003-4885-0728"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik Klumpp","raw_affiliation_strings":["University of Freiburg, Freiburg im Breisgau, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4885-0728","affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062411838","display_name":"Andreas Podelski","orcid":"https://orcid.org/0000-0003-2540-9489"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Podelski","raw_affiliation_strings":["University of Freiburg, Freiburg im Breisgau, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2540-9489","affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8074,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90926386,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"POPL","first_page":"2485","last_page":"2513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9991000294685364,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9495384693145752},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7968699932098389},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7388253211975098},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6537272930145264},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5103911757469177},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4774920642375946},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.45372888445854187},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.4357505142688751},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42448654770851135},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.42117583751678467},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.419629842042923},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4185752868652344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34232330322265625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25693032145500183},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19997650384902954}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9495384693145752},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7968699932098389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7388253211975098},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6537272930145264},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5103911757469177},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4774920642375946},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.45372888445854187},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.4357505142688751},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42448654770851135},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.42117583751678467},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.419629842042923},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4185752868652344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34232330322265625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25693032145500183},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19997650384902954},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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.1145/3632925","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632925","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632925","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"}],"best_oa_location":{"id":"doi:10.1145/3632925","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632925","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632925","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390604697.pdf","grobid_xml":"https://content.openalex.org/works/W4390604697.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1243232056","https://openalex.org/W1481307904","https://openalex.org/W1536946401","https://openalex.org/W1549714654","https://openalex.org/W1561112849","https://openalex.org/W1940110491","https://openalex.org/W2008078972","https://openalex.org/W2014175609","https://openalex.org/W2020864277","https://openalex.org/W2033546932","https://openalex.org/W2039559802","https://openalex.org/W2072062729","https://openalex.org/W2074782626","https://openalex.org/W2090547808","https://openalex.org/W2093709900","https://openalex.org/W2155487709","https://openalex.org/W2158493209","https://openalex.org/W2169870841","https://openalex.org/W2197065986","https://openalex.org/W2340697544","https://openalex.org/W2547679913","https://openalex.org/W2566058028","https://openalex.org/W2765527199","https://openalex.org/W2883180298","https://openalex.org/W2900035213","https://openalex.org/W2962297646","https://openalex.org/W2995623611","https://openalex.org/W3033402562","https://openalex.org/W3110271915","https://openalex.org/W3139581773","https://openalex.org/W4248180460","https://openalex.org/W4281968516","https://openalex.org/W4384387929","https://openalex.org/W4390604697","https://openalex.org/W4393486226"],"related_works":["https://openalex.org/W1511249877","https://openalex.org/W2466303427","https://openalex.org/W1578828174","https://openalex.org/W2000943029","https://openalex.org/W2950376466","https://openalex.org/W4302559785","https://openalex.org/W4226437312","https://openalex.org/W1969483203","https://openalex.org/W2949331520","https://openalex.org/W2140496290"],"abstract_inverted_index":{"Commutativity":[0],"has":[1,15],"proven":[2],"to":[3,40,66,84,97,254,293,305],"be":[4,95,134,159,251,287],"a":[5,18,22,42,70,130,140,145,182,200,211,291,306,318,333],"powerful":[6],"tool":[7],"in":[8,129,309],"reasoning":[9,51],"about":[10],"concurrent":[11],"programs.":[12,56],"Recent":[13],"work":[14],"shown":[16],"that":[17,80,93,116,132,190,275],"commutativity-based":[19],"reduction":[20,138,156,192],"of":[21,34,45,73,90,112,124,139,162,184,199,217,229,233,247,262,281,328,336],"program":[23,30,36,67,91,142,172,202,213,324],"may":[24,143,157],"admit":[25,144],"simpler":[26],"proofs":[27,100,125],"than":[28],"the":[29,122,169,191,230,245,314],"itself.":[31],"The":[32,155,326],"framework":[33,321],"lexicographical":[35,296],"reductions":[37,46,92,117,185],"was":[38],"introduced":[39],"formalize":[41],"broad":[43],"class":[44],"which":[47,147,285],"accommodate":[48],"sequential":[49],"(thread-local)":[50],"as":[52,54,290],"well":[53],"synchronous":[55],"Approaches":[57],"based":[58,316],"on":[59,317,332],"this":[60,76,301],"framework,":[61],"however,":[62],"were":[63],"fundamentally":[64],"limited":[65],"models":[68],"with":[69,108],"fixed/bounded":[71],"number":[72,111],"threads.":[74,113],"In":[75],"paper,":[77],"we":[78,180,276,311],"show":[79,115],"it":[81],"is":[82,173,209,224,274],"possible":[83],"define":[85,277],"an":[86,109,163,278],"effective":[87],"parametric":[88],"family":[89,280],"can":[94,133,250,286],"used":[96,289],"find":[98],"simple":[99],"for":[101,106,121,126,186,244,322],"parameterized":[102,127,141,171,187,201,212,248,323],"programs":[103,107,188,249],",":[104],"i.e.,":[105],"unbounded":[110],"We":[114],"are":[118,338],"indeed":[119],"useful":[120],"simplification":[123],"programs,":[128],"sense":[131],"made":[135],"precise:":[136],"A":[137],"proof":[146],"uses":[148],"fewer":[149],"or":[150],"less":[151],"sophisticated":[152],"ghost":[153],"variables.":[154],"therefore":[158],"within":[160],"reach":[161],"automated":[164],"verification":[165,246],"technique,":[166],"even":[167],"when":[168],"original":[170],"not.":[174],"As":[175],"our":[176,329],"first":[177],"technical":[178,272],"contribution,":[179],"introduce":[181],"notion":[183],"such":[189],"<mml:math":[193,203,218,234,255,263],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[194,204,219,235,256,264],"display=\"inline\">":[195,205,220,236,257,265],"<mml:mi":[196,206,221,237,258,266],"mathvariant=\"script\">R</mml:mi>":[197,222,259],"</mml:math>":[198,208,223,239,260,268],"mathvariant=\"script\">P</mml:mi>":[207,238,267],"again":[210],"(the":[214],"thread":[215,231],"template":[216,232],"obtained":[225],"by":[226],"source-to-source":[227],"transformation":[228],").":[240],"Consequently,":[241],"existing":[242],"techniques":[243],"directly":[252],"applied":[253],"instead":[261],".":[269],"Our":[270],"second":[271],"contribution":[273],"appropriate":[279],"pairwise":[282],"preference":[283],"orders":[284],"effectively":[288],"parameter":[292],"produce":[294],"different":[295],"reductions.":[297],"To":[298],"determine":[299],"whether":[300],"theoretical":[302],"foundation":[303],"amounts":[304],"usable":[307],"solution":[308],"practice,":[310],"have":[312],"implemented":[313],"approach,":[315],"recently":[319],"proposed":[320],"verification.":[325],"results":[327],"preliminary":[330],"experiments":[331],"representative":[334],"set":[335],"examples":[337],"encouraging.":[339]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}