{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:44Z","timestamp":1772164004789,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"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":[[2015,1,24]]},"DOI":"10.1145\/2688500.2688511","type":"proceedings-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T09:12:26Z","timestamp":1422436346000},"page":"31-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Automatic scalable atomicity via semantic locking"],"prefix":"10.1145","author":[{"given":"Guy","family":"Golan-Gueta","sequence":"first","affiliation":[{"name":"Yahoo Labs, Israel"}]},{"given":"G.","family":"Ramalingam","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Eran","family":"Yahav","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]}],"member":"320","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"gee.cs.oswego.edu\/dl\/jsr166\/dist\/jsr166edocs\/ jsr166e\/ConcurrentHashMapV8.html.  gee.cs.oswego.edu\/dl\/jsr166\/dist\/jsr166edocs\/ jsr166e\/ConcurrentHashMapV8.html."},{"key":"e_1_3_2_1_2_1","unstructured":"www.devdaily.com\/java\/jwarehouse\/apache-tomcat- 6.0.16\/java\/org\/apache\/el\/util\/ConcurrentCache.java.shtml.  www.devdaily.com\/java\/jwarehouse\/apache-tomcat- 6.0.16\/java\/org\/apache\/el\/util\/ConcurrentCache.java.shtml."},{"key":"e_1_3_2_1_3_1","unstructured":"guava-libraries. code.google.com\/p\/guava-libraries\/.  guava-libraries. code.google.com\/p\/guava-libraries\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Wala. http:\/\/wala.sourceforge.net.  Wala. http:\/\/wala.sourceforge.net."},{"key":"e_1_3_2_1_5_1","volume-title":"Concurrency Control and Recovery in Database Systems","author":"ERNSTEIN P. A.","year":"1987","unstructured":"B ERNSTEIN , P. A. , H ADZILACOS , V. , AND G OO DMAN , N. Concurrency Control and Recovery in Database Systems . Addison-Wesley , 1987 . B ERNSTEIN, P. A., H ADZILACOS, V., AND G OODMAN, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987."},{"key":"e_1_3_2_1_6_1","volume-title":"AND O LUKOTUN","author":"AO INH","year":"2008","unstructured":"C AO M INH , C., C HUNG , J. , K OZYRAKIS , C. , AND O LUKOTUN , K. STAMP : Stanford transactional applications for multi-processing. In IISWC ( 2008 ). C AO M INH, C., C HUNG, J., K OZYRAKIS, C., AND O LUKOTUN, K. STAMP: Stanford transactional applications for multi-processing. In IISWC (2008)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454456.1454466"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462172"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31057-7_15"},{"key":"e_1_3_2_1_10_1","first-page":"1","volume":"5","author":"ARRIS T.","year":"2010","unstructured":"H ARRIS , T. , L ARUS , J. , AND R A JWAR , R. Transactional memory, 2nd edition. Synthesis Lectures on Computer Architecture 5 , 1 ( 2010 ). H ARRIS, T., L ARUS, J., AND R AJWAR, R. Transactional memory, 2nd edition. Synthesis Lectures on Computer Architecture 5, 1 (2010).","journal-title":"Synthesis Lectures on Computer Architecture"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254114"},{"key":"e_1_3_2_1_12_1","volume-title":"OPODIS","author":"ERLIHY M.","year":"2006","unstructured":"H ERLIHY , M. , L EV , Y. , L UCHANGCO , V. , AND S H AVIT , N. A provably correct scalable concurrent skip list . In OPODIS ( 2006 ). H ERLIHY, M., L EV, Y., L UCHANGCO, V., AND S HAVIT, N. A provably correct scalable concurrent skip list. In OPODIS (2006)."},{"key":"e_1_3_2_1_13_1","volume-title":"Morgan Kauffman","author":"ERLIHY M.","year":"2008","unstructured":"H ERLIHY , M. , AND S H AVIT , N. The Art of Multiprocessor Programming . Morgan Kauffman , Feb. 2008 . H ERLIHY, M., AND S HAVIT, N. The Art of Multiprocessor Programming. Morgan Kauffman, Feb. 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_15_1","volume-title":"MULTIPROG","author":"ORLAND G.","year":"2010","unstructured":"K ORLAND , G. , S HAVIT , N. , AND F E LBER , P. Noninvasive concurrency with java stm . In MULTIPROG ( 2010 ). K ORLAND, G., S HAVIT, N., AND F ELBER, P. Noninvasive concurrency with java stm. In MULTIPROG (2010)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706304"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 12th international conference on Compiler construction","author":"HOT\u00c1K O.","year":"2003","unstructured":"L HOT\u00c1K , O. , AND H EN DREN , L. Scaling java points-to analysis using spark . In Proceedings of the 12th international conference on Compiler construction ( 2003 ), CC\u201903. L HOT\u00c1K, O., AND H ENDREN, L. Scaling java points-to analysis using spark. In Proceedings of the 12th international conference on Compiler construction (2003), CC\u201903."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111068"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/555142"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/989.1188"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048073"}],"event":{"name":"PPoPP '15: 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Francisco CA USA","acronym":"PPoPP '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688500.2688511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:55:45Z","timestamp":1750258545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":21,"alternative-id":["10.1145\/2688500.2688511","10.1145\/2688500"],"URL":"https:\/\/doi.org\/10.1145\/2688500.2688511","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858788.2688511","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,24]]},"assertion":[{"value":"2015-01-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}