{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:39Z","timestamp":1772163939099,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,9]],"date-time":"2010-01-09T00:00:00Z","timestamp":1262995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,1,9]]},"DOI":"10.1145\/1693453.1693503","type":"proceedings-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T15:23:12Z","timestamp":1263309792000},"page":"339-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Supporting lock-free composition of concurrent data objects"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Cederman","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, G\u00f6teborg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, G\u00f6teborg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454456.1454466"},{"key":"e_1_3_2_1_2_1","volume-title":"NBmalloc: Allocating Memory in a Lock-Free Manner. Algorithmica","author":"Gidenstam A.","year":"2009","unstructured":"A. Gidenstam , M. Papatriantafilou , and P. Tsigas . NBmalloc: Allocating Memory in a Lock-Free Manner. Algorithmica , 2009 . ISSN 0178-4617. doi: http:\/\/dx.doi.org\/10.1007\/s00453-008-9268-x. 10.1007\/s00453-008-9268-x A. Gidenstam, M. Papatriantafilou, and P. Tsigas. NBmalloc: Allocating Memory in a Lock-Free Manner. Algorithmica, 2009. ISSN 0178-4617. doi: http:\/\/dx.doi.org\/10.1007\/s00453-008-9268-x."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_4_1","volume-title":"Threading Building Blocks","year":"2009","unstructured":"Intel. Threading Building Blocks , 2009 . URL http:\/\/threadingbuildingblocks.org. Intel. Threading Building Blocks, 2009. URL http:\/\/threadingbuildingblocks.org."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364782.1364800"},{"key":"e_1_3_2_1_6_1","volume-title":"The Java Concurrency Package (JSR-166)","author":"Lea D.","year":"2009","unstructured":"D. Lea . The Java Concurrency Package (JSR-166) , 2009 . URL http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest. D. Lea. The Java Concurrency Package (JSR-166), 2009. URL http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_8_1","volume-title":"Parallel Computing Developer Center","year":"2009","unstructured":"Microsoft. Parallel Computing Developer Center , 2009 . URL http:\/\/msdn.microsoft.com\/en-us\/concurrency. Microsoft. Parallel Computing Developer Center, 2009. URL http:\/\/msdn.microsoft.com\/en-us\/concurrency."},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers","author":"Sundell H.","year":"2002","unstructured":"H. Sundell and P. Tsigas . NOBLE: A Non-Blocking Inter-Process Communication Library . In Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers , Lecture Notes in Computer Science . Springer Verlag , 2002 . URL http:\/\/citeseer.ist.psu.edu\/sundell02noble.html. H. Sundell and P. Tsigas. NOBLE: A Non-Blocking Inter-Process Communication Library. In Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, Lecture Notes in Computer Science. Springer Verlag, 2002. URL http:\/\/citeseer.ist.psu.edu\/sundell02noble.html."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/384268.378810"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/584369.584378"}],"event":{"name":"PPoPP '10: ACM SIGPLAN Principles and Practice of Parallel Computing","location":"Bangalore India","acronym":"PPoPP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1693453.1693503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:45:35Z","timestamp":1750236335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,9]]},"references-count":11,"alternative-id":["10.1145\/1693453.1693503","10.1145\/1693453"],"URL":"https:\/\/doi.org\/10.1145\/1693453.1693503","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1837853.1693503","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,9]]},"assertion":[{"value":"2010-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}