{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:18Z","timestamp":1772164038522,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"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":[[2013,10,29]]},"DOI":"10.1145\/2509136.2509517","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T11:29:17Z","timestamp":1382527757000},"page":"605-622","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Barrier invariants"],"prefix":"10.1145","author":[{"given":"Nathan","family":"Chong","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alastair F.","family":"Donaldson","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul H.J.","family":"Kelly","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"Ketema","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaz","family":"Qadeer","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384625"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572795"},{"key":"e_1_3_2_1_4_1","volume-title":"Synthesis of Parallel Algorithms. Morgan Kaufmann","author":"Blelloch G. E.","year":"1990","unstructured":"G. E. Blelloch . Prefix sums and their applications. In J. H. Reif, editor , Synthesis of Parallel Algorithms. Morgan Kaufmann , 1990 . G. E. Blelloch. Prefix sums and their applications. In J. H. Reif, editor, Synthesis of Parallel Algorithms. Morgan Kaufmann, 1990."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675982"},{"key":"e_1_3_2_1_6_1","first-page":"209","volume-title":"OSDI","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. R. Engler . KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs . In OSDI , pages 209 -- 224 , 2008 . C. Cadar, D. Dunbar, and D. R. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209--224, 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2009.5306797"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38088-4_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30494-4_27"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34188-5_18"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946284.1946297"},{"key":"e_1_3_2_1_18_1","volume-title":"Parallel prefix sum (scan) with CUDA","author":"Harris M.","year":"2007","unstructured":"M. Harris , S. Sengupta , and J. D. Owens . Parallel prefix sum (scan) with CUDA . In H. Nguyen, editor, GPU Gems 3. Addison-Wesley , 2007 . M. Harris, S. Sengupta, and J. D. Owens. Parallel prefix sum (scan) with CUDA. In H. Nguyen, editor, GPU Gems 3. Addison-Wesley, 2007."},{"key":"e_1_3_2_1_19_1","volume-title":"BYTECODE","author":"Huisman M.","year":"2013","unstructured":"M. Huisman and M. Mihel\u010di\u0107 . Specification and verification of GPGPU programs using permission-based separation logic . In BYTECODE , 2013 . M. Huisman and M. Mihel\u010di\u0107. Specification and verification of GPGPU programs using permission-based separation logic. In BYTECODE, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941573"},{"key":"e_1_3_2_1_22_1","volume-title":"The OpenCL specification, version 1.2","author":"Khronos OpenCL Working Group","year":"2012","unstructured":"Khronos OpenCL Working Group . The OpenCL specification, version 1.2 , 2012 . Khronos OpenCL Working Group. The OpenCL specification, version 1.2, 2012."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254110"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882320"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145844"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389036"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646704.702020"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670412.1670416"},{"key":"e_1_3_2_1_30_1","volume-title":"CUDA C programming guide, version 5.0","author":"NVIDIA.","year":"2012","unstructured":"NVIDIA. CUDA C programming guide, version 5.0 , 2012 . NVIDIA. CUDA C programming guide, version 5.0, 2012."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27940-9_27"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1517424.1517434"}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Indianapolis Indiana USA","acronym":"SPLASH '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509136.2509517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:34Z","timestamp":1750217314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509517"}},"subtitle":["a shared state abstraction for the analysis of data-dependent GPU kernels"],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":33,"alternative-id":["10.1145\/2509136.2509517","10.1145\/2509136"],"URL":"https:\/\/doi.org\/10.1145\/2509136.2509517","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544173.2509517","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,10,29]]},"assertion":[{"value":"2013-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}