{"id":"https://openalex.org/W2138927523","doi":"https://doi.org/10.1145/1122971.1122992","title":"Proving correctness of highly-concurrent linearisable objects","display_name":"Proving correctness of highly-concurrent linearisable objects","publication_year":2006,"publication_date":"2006-03-29","ids":{"openalex":"https://openalex.org/W2138927523","doi":"https://doi.org/10.1145/1122971.1122992","mag":"2138927523"},"language":"en","primary_location":{"id":"doi:10.1145/1122971.1122992","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1122971.1122992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01248204","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023359178","display_name":"Viktor Vafeiadis","orcid":"https://orcid.org/0000-0001-8436-0334"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Viktor Vafeiadis","raw_affiliation_strings":["University of Cambridge"],"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086347882","display_name":"Maurice Herlihy","orcid":"https://orcid.org/0000-0002-3059-8926"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]},{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maurice Herlihy","raw_affiliation_strings":["Brown University","Brown University - Department of Computer Science (Brown University Box 1910 Providence, RI 02912, USA - United States)"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]},{"raw_affiliation_string":"Brown University - Department of Computer Science (Brown University Box 1910 Providence, RI 02912, USA - United States)","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104358477","display_name":"Tony Hoare","orcid":null},"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":"Tony Hoare","raw_affiliation_strings":["Microsoft Research Cambridge","Microsoft - Microsoft Research [Cambridge] (Roger Needham Building 7 J J Thomson Ave Cambridge CB3 0FB, UK - United Kingdom)"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft - Microsoft Research [Cambridge] (Roger Needham Building 7 J J Thomson Ave Cambridge CB3 0FB, UK - United Kingdom)","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015390291","display_name":"Marc Shapiro","orcid":"https://orcid.org/0000-0002-8953-9322"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Shapiro","raw_affiliation_strings":["INRIA Rocquencourt &amp; LIP6","Regal - Large-Scale Distributed Systems and Applications (France)"],"affiliations":[{"raw_affiliation_string":"INRIA Rocquencourt &amp; LIP6","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Regal - Large-Scale Distributed Systems and Applications (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023359178"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":10.0802,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.98310463,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"136"},"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.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9962000250816345,"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/computer-science","display_name":"Computer science","score":0.8450616598129272},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8298690319061279},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7178057432174683},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6660541892051697},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.6093521118164062},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5657577514648438},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5186437964439392},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.506217896938324},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4991908073425293},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4445984363555908},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.42252254486083984},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3701671361923218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09960433840751648}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8450616598129272},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8298690319061279},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7178057432174683},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6660541892051697},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.6093521118164062},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5657577514648438},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5186437964439392},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.506217896938324},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4991908073425293},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4445984363555908},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.42252254486083984},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3701671361923218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09960433840751648},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1122971.1122992","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1122971.1122992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.77.7703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.7703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-sor.inria.fr/~shapiro/papers/PPoPP-2006-listRG.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.8792","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.8792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~mph/VafeiadisHHS06/p129-vafeiadis.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01248204v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01248204","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2006, New York, United States. pp.129--136, &#x27E8;10.1145/1122971.1122992&#x27E9;","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:inria-00070301v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00070301","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"[Research Report] RR-5716, INRIA. 2005, pp.20","raw_type":"Reports"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:c8c213e7-a04b-46af-8450-755f77d2ad9b","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:c8c213e7-a04b-46af-8450-755f77d2ad9b","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01248204v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01248204","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2006, New York, United States. pp.129--136, &#x27E8;10.1145/1122971.1122992&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W80370608","https://openalex.org/W1488659932","https://openalex.org/W1491772622","https://openalex.org/W1495128589","https://openalex.org/W1520380662","https://openalex.org/W1540997098","https://openalex.org/W1965662337","https://openalex.org/W1972544179","https://openalex.org/W1980806195","https://openalex.org/W1993301893","https://openalex.org/W2000302396","https://openalex.org/W2015688007","https://openalex.org/W2015874281","https://openalex.org/W2068820234","https://openalex.org/W2082766667","https://openalex.org/W2099899133","https://openalex.org/W2100044151","https://openalex.org/W2101939036","https://openalex.org/W2112381327","https://openalex.org/W2121405115","https://openalex.org/W2131791649","https://openalex.org/W2159392969","https://openalex.org/W2296232480","https://openalex.org/W2483406187","https://openalex.org/W6603259056"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,20,61,87],"family":[3],"of":[4,32,71,76,78,83],"implementations":[5],"for":[6,24,90],"linked":[7],"lists":[8],"using":[9],"fine-grain":[10],"synchronisation.":[11,27,43],"This":[12],"approach":[13],"enables":[14],"greater":[15,21],"concurrency,":[16],"but":[17],"correctness":[18],"is":[19],"challenge":[22,89],"than":[23],"classical,":[25],"coarse-grain":[26],"Our":[28,64],"examples":[29,82],"are":[30,46,47,54],"demonstrative":[31],"common":[33],"design":[34],"patterns":[35],"such":[36],"as":[37,74],"lock":[38],"coupling,":[39],"optimistic,":[40],"and":[41,57,69],"lazy":[42],"Although":[44],"they":[45,53,58],"highly":[48],"concurrent,":[49],"we":[50],"prove":[51],"that":[52],"linearisable,":[55],"safe,":[56],"correctly":[59],"implement":[60],"high-level":[62],"abstraction.":[63],"proofs":[65],"illustrate":[66],"the":[67,84],"power":[68],"applicability":[70],"rely-guarantee":[72],"reasoning,":[73],"well":[75],"some":[77],"its":[79],"limitations.":[80],"The":[81],"paper":[85],"establish":[86],"benchmark":[88],"other":[91],"reasoning":[92],"techniques.":[93]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
