{"id":"https://openalex.org/W4412482056","doi":"https://doi.org/10.1145/3694906.3743304","title":"Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot Algorithm","display_name":"Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot Algorithm","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412482056","doi":"https://doi.org/10.1145/3694906.3743304"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743304","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743304","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743304","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 37th ACM Symposium on Parallelism in Algorithms and Architectures","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/3694906.3743304","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008303793","display_name":"Siddhartha Jayanti","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Siddhartha Jayanti","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA"],"raw_orcid":"https://orcid.org/0000-0002-2681-1632","affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050222021","display_name":"U\u011fur Yavuz","orcid":"https://orcid.org/0000-0002-6218-2466"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ugur Y. Yavuz","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-6218-2466","affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008303793"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":null,"apc_paid":null,"fwci":1.3517,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83811561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"540","last_page":"554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"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/T10829","display_name":"Interconnection Networks and Systems","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/snapshot","display_name":"Snapshot (computer storage)","score":0.7957973480224609},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7194827198982239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5010063648223877},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.4578917920589447},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23586934804916382},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09407979249954224}],"concepts":[{"id":"https://openalex.org/C55282118","wikidata":"https://www.wikidata.org/wiki/Q252683","display_name":"Snapshot (computer storage)","level":2,"score":0.7957973480224609},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7194827198982239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5010063648223877},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.4578917920589447},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23586934804916382},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09407979249954224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743304","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743304","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743304","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 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743304","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743304","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743304","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 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412482056.pdf","grobid_xml":"https://content.openalex.org/works/W4412482056.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1504504841","https://openalex.org/W1818449680","https://openalex.org/W1982100000","https://openalex.org/W1993805917","https://openalex.org/W2015688007","https://openalex.org/W2017559473","https://openalex.org/W2030333832","https://openalex.org/W2100505193","https://openalex.org/W2101939036","https://openalex.org/W2132107743","https://openalex.org/W2155298875","https://openalex.org/W2162022306","https://openalex.org/W2328819335","https://openalex.org/W2596852931","https://openalex.org/W2901454403","https://openalex.org/W2996703997","https://openalex.org/W3133195734","https://openalex.org/W3193924946","https://openalex.org/W4210597939","https://openalex.org/W4226030675","https://openalex.org/W4315606551","https://openalex.org/W4390603423","https://openalex.org/W4411278300","https://openalex.org/W6968630555"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2542847180","https://openalex.org/W3034994054","https://openalex.org/W2051487156","https://openalex.org/W2805712290","https://openalex.org/W2155226960","https://openalex.org/W2548022288","https://openalex.org/W2909129499"],"abstract_inverted_index":{"In":[0,160,180],"this":[1,253],"work,":[2,162],"we":[3,163],"consider":[4],"the":[5,19,67,74,80,116,125,143,155,165,183,196,248],"MemSnap":[6,91,210],"algorithm":[7,126],"[Jayanti":[8],"et":[9],"al.,":[10],"PODC":[11],"2024]---an":[12],"efficient,":[13],"yet":[14],"extremely":[15,128],"intricate":[16,129],"solution":[17],"to":[18,43,58,72,114,132,187],"adaptive":[20,34],"snapshot":[21,35,63,194],"problem---and":[22],"give":[23],"a":[24,55,60,158,172,192,222],"formally":[25],"machine-verified":[26,224,250],"proof":[27,225,251],"of":[28,64,66,76,89,121,147,168,195,218,226,232,235,252],"its":[29,227],"correctness,":[30],"i.e.,":[31],"linearizability.":[32,228],"An":[33],"object":[36],"maintains":[37],"m":[38,122,197],"components":[39,49,198],"and":[40,46,69,99,109,130,220,246,255],"supports":[41],"operations":[42],"read,":[44],"write,":[45],"update":[47],"individual":[48],"(via":[50],"arbitrary":[51],"hardware":[52],"read-modify-write":[53],"operations),":[54],"click":[56],"operation":[57,71,104,149,156],"take":[59],"fast":[61],"(implicit)":[62],"all":[65],"components,":[68],"an":[70,148,203],"observe":[73],"value":[75],"any":[77],"component":[78],"in":[79,84,105,199,211],"latest":[81],"snapshot.":[82],"Expressed":[83],"just":[85,106],"12":[86],"total":[87],"lines":[88,234],"pseudocode,":[90],"is":[92,127,138,238,247],"succinct.":[93],"Simultaneously,":[94],"it":[95,137,189],"achieves":[96],"optimal":[97],"time":[98],"space":[100,113],"complexity,":[101],"implementing":[102],"each":[103],"O(1)":[107,204],"steps":[108],"requiring":[110],"only":[111],"O(m)":[112,200],"store":[115],"entire":[117],"data":[118],"structure":[119],"consisting":[120,231],"components.":[123],"Nevertheless,":[124],"challenging":[131],"prove":[133],"correct,":[134],"especially":[135],"since":[136],"far-future":[139],"linearizable,":[140],"meaning":[141],"that":[142],"precise":[144],"linearization":[145],"point":[146],"may":[150],"be":[151],"indeterminate":[152],"even":[153],"after":[154],"returns":[157],"response.":[159],"our":[161],"formalize":[164,209],"enhanced":[166],"version":[167],"MemSnap,":[169],"which":[170],"enables":[171],"very":[173],"useful":[174],"parallel":[175,178],"primitive,":[176],"called":[177],"observation.":[179],"particular,":[181],"if":[182],"scanner":[184],"has":[185],"access":[186],"parallelism,":[188],"can":[190],"scan":[191],"complete":[193,223],"work":[201],"with":[202],"span":[205],"using":[206],"MemSnap.":[207],"We":[208],"TLA+":[212,236,243],"(based":[213],"on":[214],"Lamport's":[215],"temporal":[216],"logic":[217],"actions)":[219],"develop":[221],"Our":[229],"proof,":[230],"14,000":[233],"code,":[237],"verified":[239],"by":[240],"TLAPS":[241],"(the":[242],"Proof":[244],"System),":[245],"first":[249],"elegant":[254],"complex":[256],"algorithm.":[257]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}