{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:29Z","timestamp":1783576949446,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T00:00:00Z","timestamp":1421193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["S11404-N23"],"award-info":[{"award-number":["S11404-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000608","name":"London Mathematical Society","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,14]]},"DOI":"10.1145\/2676726.2676963","type":"proceedings-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T08:51:05Z","timestamp":1418979065000},"page":"233-246","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["A Scalable, Correct Time-Stamped Stack"],"prefix":"10.1145","author":[{"given":"Mike","family":"Dodds","sequence":"first","affiliation":[{"name":"University of York, York, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Haas","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph M.","family":"Kirsch","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926442"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_37"},{"key":"e_1_3_2_2_4_1","unstructured":"M. Batty M. Dodds and A. Gotsman. Library abstraction for C\/C"},{"key":"e_1_3_2_2_5_1","volume-title":"phPOPL","year":"2013","unstructured":"concurrency. In phPOPL, 2013."},{"key":"e_1_3_2_2_6_1","unstructured":"}scalComputational Systems Group University of Salzburg. Scal framework. URL http:\/\/scal.cs.uni-salzburg.at."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484279"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414731"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482767.2482789"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_2_12_1","unstructured":"Henzinger Payer and Sezgin}Henzinger13bT. Henzinger H. Payer and A. Sezgin. Replacing competition with cooperation to achieve scalable lock-free FIFO queues. Technical Report IST-2013--124-v1"},{"key":"e_1_3_2_2_13_1","unstructured":"1 IST Austria 2013\\natexlaba."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_18"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734069"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782394.1782423"},{"key":"e_1_3_2_2_18_1","volume-title":"Intel 64 and ia-32 architectures software developer's manual","year":"2013","unstructured":"Intel. Intel 64 and ia-32 architectures software developer's manual, volume 3b: System programming guide, part 2, 2013. URL http:\/\/download.intel.com\/products\/processor\/manual\/253669.pdf."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1296907.1296912"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555297"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1785414.1785443"},{"key":"e_1_3_2_2_24_1","unstructured":"R. Treiber. Systems programming: Coping with parallelism. Technical Report RJ5118 IBM Almaden Research Center April 1986."}],"event":{"name":"POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Mumbai India","acronym":"POPL '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2676963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2676726.2676963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T08:36:46Z","timestamp":1781858206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2676963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,14]]},"references-count":24,"alternative-id":["10.1145\/2676726.2676963","10.1145\/2676726"],"URL":"https:\/\/doi.org\/10.1145\/2676726.2676963","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775051.2676963","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,14]]},"assertion":[{"value":"2015-01-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}