{"id":"https://openalex.org/W4399850791","doi":"https://doi.org/10.1145/3652024.3665507","title":"Reference Counting Deeply Immutable Data Structures with Cycles: An Intellectual Abstract","display_name":"Reference Counting Deeply Immutable Data Structures with Cycles: An Intellectual Abstract","publication_year":2024,"publication_date":"2024-06-20","ids":{"openalex":"https://openalex.org/W4399850791","doi":"https://doi.org/10.1145/3652024.3665507"},"language":"en","primary_location":{"id":"doi:10.1145/3652024.3665507","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3652024.3665507","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3652024.3665507","source":null,"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 2024 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3652024.3665507","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001725251","display_name":"Matthew Parkinson","orcid":"https://orcid.org/0009-0004-3937-1260"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthew J. Parkinson","raw_affiliation_strings":["Microsoft Azure Research, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0009-0004-3937-1260","affiliations":[{"raw_affiliation_string":"Microsoft Azure Research, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059345262","display_name":"Sylvan Clebsch","orcid":"https://orcid.org/0009-0004-4049-134X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sylvan Clebsch","raw_affiliation_strings":["Microsoft Azure Research, Austin, USA"],"raw_orcid":"https://orcid.org/0009-0004-4049-134X","affiliations":[{"raw_affiliation_string":"Microsoft Azure Research, Austin, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053132997","display_name":"Tobias Wrigstad","orcid":"https://orcid.org/0000-0002-4269-5408"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Tobias Wrigstad","raw_affiliation_strings":["Uppsala University, Uppsala, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-4269-5408","affiliations":[{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.886,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70640835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"141"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.994700014591217,"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.8119618892669678},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6829127073287964},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.6688318252563477},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6389349102973938},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5938917398452759},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.555160641670227},{"id":"https://openalex.org/keywords/immutability","display_name":"Immutability","score":0.45984968543052673},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45692846179008484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45256027579307556},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.45133501291275024},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.40629321336746216},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.2898746132850647},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11336201429367065}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8119618892669678},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6829127073287964},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.6688318252563477},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6389349102973938},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5938917398452759},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.555160641670227},{"id":"https://openalex.org/C2776126399","wikidata":"https://www.wikidata.org/wiki/Q3942906","display_name":"Immutability","level":3,"score":0.45984968543052673},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45692846179008484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45256027579307556},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.45133501291275024},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40629321336746216},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.2898746132850647},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11336201429367065},{"id":"https://openalex.org/C2779687700","wikidata":"https://www.wikidata.org/wiki/Q20514253","display_name":"Blockchain","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3652024.3665507","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3652024.3665507","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3652024.3665507","source":null,"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 2024 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:uu-536797","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-536797","pdf_url":"https://uu.diva-portal.org/smash/get/diva2:1893555/FULLTEXT01","source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":{"id":"doi:10.1145/3652024.3665507","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3652024.3665507","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3652024.3665507","source":null,"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 2024 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399850791.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1569153617","https://openalex.org/W1596586791","https://openalex.org/W1986022261","https://openalex.org/W1993155808","https://openalex.org/W2001595400","https://openalex.org/W2009049834","https://openalex.org/W2031707629","https://openalex.org/W2044146725","https://openalex.org/W2049820860","https://openalex.org/W2050800168","https://openalex.org/W2067901725","https://openalex.org/W2070992781","https://openalex.org/W2077987280","https://openalex.org/W2100885195","https://openalex.org/W2103957752","https://openalex.org/W2118382442","https://openalex.org/W2122176518","https://openalex.org/W2136618368","https://openalex.org/W2240421584","https://openalex.org/W2955849675","https://openalex.org/W2977286659","https://openalex.org/W3112414036","https://openalex.org/W4230681750"],"related_works":["https://openalex.org/W4312626387","https://openalex.org/W1651168384","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W1989082972","https://openalex.org/W2015160737","https://openalex.org/W2963257479","https://openalex.org/W4308258772","https://openalex.org/W2341576050","https://openalex.org/W1521349229"],"abstract_inverted_index":{"Immutable":[0],"data":[1,16,97,138],"structures":[2],"are":[3,55,160],"a":[4,105,110,166,198],"powerful":[5],"tool":[6],"for":[7,20,169],"building":[8],"concurrent":[9],"programs.":[10],"They":[11],"allow":[12],"the":[13,18,34,37,68,93,117,123,149,155,158,187,208,215,225,228,233,239,242],"sharing":[14],"of":[15,36,87,95,119,125,151,189,227,241],"without":[17],"need":[19],"locks":[21],"or":[22,109,258],"other":[23],"synchronisation":[24],"mechanisms.":[25],"This":[26,244],"makes":[27],"it":[28,72],"much":[29],"easier":[30],"to":[31,74,91,103,235,256],"reason":[32],"about":[33],"correctness":[35],"program.":[38],"In":[39,128],"this":[40,85,129],"paper,":[41,130],"we":[42,46,131,212],"focus":[43],"on":[44,67,154],"what":[45],"call":[47],"deep":[48],"immutability":[49,88],"from":[50,64],"freeze,":[51],"that":[52,65,133,157,186,206,220],"is,":[53],"objects":[54],"initially":[56],"mutable,":[57],"and":[58,63,70,122,175,182,230,249],"then":[59,231],"can":[60,76,140,192,213],"be":[61,79,141,193],"frozen,":[62],"point":[66],"object":[69],"everything":[71],"refers":[73],"(transitively)":[75],"no":[77],"longer":[78],"mutated.":[80],"A":[81],"key":[82,203],"challenge":[83],"with":[84,179],"form":[86],"is":[89,102,205,210,221],"\u201chow":[90],"manage":[92],"memory":[94,120,126,134],"cyclic":[96],"structures?\u201d":[98],"The":[99,202],"standard":[100],"approach":[101,164],"use":[104,232],"garbage":[106],"collector":[107],"(GC),":[108],"back-up":[111],"cycle":[112],"detector.":[113],"These":[114],"approaches":[115],"sacrifice":[116],"promptness":[118],"reclamation,":[121],"determinism":[124],"usage.":[127],"argue":[132],"underlying":[135],"an":[136],"immutable":[137],"structure":[139],"efficiently":[142,195],"managed":[143],"using":[144,196],"reference":[145,200,236],"counting":[146],"even":[147],"in":[148,218,224],"presence":[150],"cycles,":[152],"based":[153],"observation":[156,204],"cycles":[159],"themselves":[161],"immutable.":[162],"Our":[163],"takes":[165],"classic":[167],"algorithm":[168],"calculating":[170],"strongly":[171],"connected":[172],"components":[173],"(SCCs)":[174],"managing":[176],"equivalence":[177],"classes":[178],"union-find":[180],"(UF),":[181],"combines":[183],"them":[184],"so":[185],"liveness":[188],"each":[190],"SCC":[191],"tracked":[194],"only":[197],"single":[199],"counter.":[201],"since":[207],"graph":[209],"unchanging,":[211],"calculate":[214],"SCCs":[216],"once,":[217],"time":[219],"almost":[222],"linear":[223],"size":[226],"graph,":[229],"result":[234],"count":[237],"at":[238],"level":[240],"SCCs.":[243],"gives":[245],"precise":[246],"reachability":[247],"information,":[248],"does":[250],"not":[251],"require":[252],"any":[253],"backup":[254],"mechanism":[255],"detect":[257],"handle":[259],"cycles.":[260]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}