{"id":"https://openalex.org/W4293812587","doi":"https://doi.org/10.1145/3547646","title":"Entanglement detection with near-zero cost","display_name":"Entanglement detection with near-zero cost","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4293812587","doi":"https://doi.org/10.1145/3547646"},"language":"en","primary_location":{"id":"doi:10.1145/3547646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547646","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547646","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/3547646","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052738437","display_name":"Sam Westrick","orcid":"https://orcid.org/0000-0003-2848-9808"},"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":"Sam Westrick","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":"https://orcid.org/0000-0003-2848-9808","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035801565","display_name":"Jatin Arora","orcid":"https://orcid.org/0000-0001-8302-6844"},"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":"Jatin Arora","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":"https://orcid.org/0000-0001-8302-6844","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015051107","display_name":"Umut A. Acar","orcid":"https://orcid.org/0000-0002-2623-4986"},"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":"Umut A. Acar","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":"https://orcid.org/0000-0002-2623-4986","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.4248,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"6","issue":"ICFP","first_page":"679","last_page":"710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9954000115394592,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8548184037208557},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6596291661262512},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.516939103603363},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5018973350524902},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.4975745975971222},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49032118916511536},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4665600657463074},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.422377347946167},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3806002140045166},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3653602600097656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8548184037208557},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6596291661262512},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.516939103603363},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5018973350524902},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.4975745975971222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49032118916511536},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4665600657463074},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.422377347946167},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3806002140045166},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3653602600097656},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3547646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547646","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547646","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/3547646","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3547646","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3547646","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.7699999809265137,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1562374711","display_name":"SHF: Small: Solving the Parallel Functional Programming Challenge","funder_award_id":"2115104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5360328037","display_name":"Collaborative Research: PPoSS: LARGE: Unifying Software and Hardware to Achieve Performant and Scalable Frictionless Parallelism in the Heterogeneous Future","funder_award_id":"2119352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G753685075","display_name":"Collaborative Research: SHF: Medium: Responsive Parallelism for Interactive Applications: Theory and Practice","funder_award_id":"2107241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293812587.pdf","grobid_xml":"https://content.openalex.org/works/W4293812587.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W92412884","https://openalex.org/W1543830735","https://openalex.org/W1965122136","https://openalex.org/W1965708711","https://openalex.org/W1970603441","https://openalex.org/W1975579741","https://openalex.org/W1986804682","https://openalex.org/W1993621349","https://openalex.org/W1994257154","https://openalex.org/W1995674161","https://openalex.org/W1999241319","https://openalex.org/W1999662401","https://openalex.org/W2003607268","https://openalex.org/W2009122662","https://openalex.org/W2016323637","https://openalex.org/W2019380637","https://openalex.org/W2025442455","https://openalex.org/W2059259057","https://openalex.org/W2063591933","https://openalex.org/W2098297530","https://openalex.org/W2098298678","https://openalex.org/W2104861744","https://openalex.org/W2105794846","https://openalex.org/W2109065830","https://openalex.org/W2110839939","https://openalex.org/W2119816515","https://openalex.org/W2125650214","https://openalex.org/W2127989655","https://openalex.org/W2148599839","https://openalex.org/W2150848984","https://openalex.org/W2169907127","https://openalex.org/W2170200862","https://openalex.org/W2172013743","https://openalex.org/W2436525433","https://openalex.org/W2470978318","https://openalex.org/W2508222108","https://openalex.org/W2562123954","https://openalex.org/W2606910946","https://openalex.org/W2624869780","https://openalex.org/W2783280912","https://openalex.org/W2911748475","https://openalex.org/W2913263777","https://openalex.org/W2995593132","https://openalex.org/W3007400938","https://openalex.org/W3019259517","https://openalex.org/W3033203490","https://openalex.org/W3041215255","https://openalex.org/W3098874119","https://openalex.org/W3113163436","https://openalex.org/W3122002490","https://openalex.org/W4220678359","https://openalex.org/W4220876151","https://openalex.org/W4225295217","https://openalex.org/W4236306709","https://openalex.org/W4238347373","https://openalex.org/W4238388226","https://openalex.org/W4244329725","https://openalex.org/W4248655060","https://openalex.org/W4248901744","https://openalex.org/W4250678240","https://openalex.org/W4256739278","https://openalex.org/W6649120592","https://openalex.org/W6912872412"],"related_works":["https://openalex.org/W2379153735","https://openalex.org/W2046172023","https://openalex.org/W2170146914","https://openalex.org/W2972896947","https://openalex.org/W2083974823","https://openalex.org/W2355105570","https://openalex.org/W2072751097","https://openalex.org/W4237177615","https://openalex.org/W2289257917","https://openalex.org/W2104462386"],"abstract_inverted_index":{"Recent":[0],"research":[1],"on":[2,191,237,263],"parallel":[3,16,46,143],"functional":[4,108,133],"programming":[5],"has":[6,20,250],"culminated":[7],"in":[8,107,148,176,211],"a":[9,43,88,128,132,181,219],"provably":[10],"efficient":[11],"(in":[12],"work":[13,193],"and":[14,31,37,101,144,168,194,227,230,253,266],"space)":[15],"memory":[17,40,97],"manager,":[18],"which":[19,50,103],"been":[21],"incorporated":[22],"into":[23],"the":[24,80,84,121,149,152,162,165,192,202,212],"MPL":[25,213],"(MaPLe)":[26],"compiler":[27,214],"for":[28,76,116,131,139,156,172,215],"Parallel":[29,216],"ML":[30],"shown":[32],"to":[33,62,83,241],"deliver":[34],"practical":[35,207],"efficiency":[36],"scalability.":[38],"The":[39],"manager":[41],"exploits":[42],"property":[44],"of":[45,164,184,196,221,233],"programs":[47],"called":[48],"disentanglement,":[49,78],"restricts":[51],"computations":[52],"from":[53,67],"accessing":[54],"concurrently":[55],"allocated":[56],"objects.":[57],"Disentanglement":[58],"is":[59,87,104,123],"closely":[60],"related":[61],"race-freedom,":[63,70],"but":[64],"subtly":[65],"differs":[66],"it.":[68],"Unlike":[69],"however,":[71],"no":[72,261],"known":[73],"techniques":[74,115,171,205],"exists":[75],"ensuring":[77],"leaving":[79],"task":[81],"entirely":[82],"programmer.":[85],"This":[86],"challenging":[89],"task,":[90],"because":[91],"it":[92,174],"requires":[93,154],"reasoning":[94],"about":[95],"low-level":[96],"operations":[98],"(e.g.,":[99],"allocations":[100],"accesses),":[102],"especially":[105],"difficult":[106],"languages.":[109],"In":[110],"this":[111],"paper,":[112],"we":[113,223],"present":[114,127,169,224],"detecting":[117],"entanglement":[118,140,185,203,248],"dynamically,":[119],"while":[120],"program":[122],"running.":[124],"We":[125,160,187,199],"first":[126],"dynamic":[129,166],"semantics":[130,153,167],"language":[134],"with":[135,239,258],"references":[136],"that":[137,201,247],"checks":[138,155],"by":[141,178,208],"consulting":[142],"sequential":[145],"dependency":[146],"relations":[147],"program.":[150],"Notably,":[151],"mutable":[157],"objects":[158],"only.":[159],"prove":[161],"soundness":[163],"several":[170],"realizing":[173],"efficiently,":[175],"particular":[177],"pruning":[179],"away":[180],"large":[182],"number":[183],"checks.":[186],"also":[188],"provide":[189],"bounds":[190],"space":[195,231],"our":[197],"techniques.":[198],"show":[200,246],"detection":[204,249],"are":[206],"implementing":[209],"them":[210],"ML.":[217],"Considering":[218],"variety":[220],"benchmarks,":[222],"an":[225],"evaluation":[226],"measure":[228],"time":[229],"overheads":[232],"less":[234],"than":[235],"5%":[236],"average":[238],"up":[240],"72":[242],"cores.":[243],"These":[244],"results":[245],"negligible":[251],"cost":[252],"can":[254],"therefore":[255],"remain":[256],"deployed":[257],"little":[259],"or":[260],"impact":[262],"efficiency,":[264],"scalability,":[265],"space.":[267]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}