{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:35:37Z","timestamp":1777498537470,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T00:00:00Z","timestamp":1319241600000},"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":[[2011,10,22]]},"DOI":"10.1145\/2048066.2048086","type":"proceedings-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T08:23:06Z","timestamp":1319530986000},"page":"225-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Automatic fine-grain locking using shape properties"],"prefix":"10.1145","author":[{"given":"Guy","family":"Golan-Gueta","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Bronson","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Ramalingam","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Yahav","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"307","volume-title":"Advances in knowledge discovery and data mining","author":"Agrawal R.","year":"1996","unstructured":"Agrawal , R. , Mannila , H. , Srikant , R. , Toivonen , H. , and Verkamo , I . Advances in knowledge discovery and data mining . American Association for Artificial Intelligence , Menlo Park, CA, USA , 1996 , ch. Fast discovery of association rules, pp. 307 -- 328 . Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, I. Advances in knowledge discovery and data mining. American Association for Artificial Intelligence, Menlo Park, CA, USA, 1996, ch. Fast discovery of association rules, pp. 307--328."},{"key":"e_1_3_2_1_2_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"2006","unstructured":"Aho , A. V. , Lam , M. S. , Sethi , R. , and Ullman , J. D . Compilers: Principles, Techniques, and Tools ( 2 nd Edition). Addison Wesley , 2006 . Aho, A. V., Lam, M. S., Sethi, R., and Ullman, J. D. Compilers: Principles, Techniques, and Tools (2nd Edition). Addison Wesley, 2006.","edition":"2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63531"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706305"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582440"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1434862"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.212464"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375619"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788374.1788399"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/360336.360345"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190260"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/360363.360369"},{"key":"e_1_3_2_1_17_1","volume-title":"November","author":"Gudka K.","year":"2010","unstructured":"Gudka , K. , Eisenbach , S. , and Harris , T . Lock Inference in the Presence of Large Libraries. Tech. rep ., November 2010 . Gudka, K., Eisenbach, S., and Harris, T. Lock Inference in the Presence of Large Libraries. Tech. rep., November 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855056"},{"key":"e_1_3_2_1_20_1","volume-title":"OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems (December","author":"Herlihy M.","year":"2006","unstructured":"Herlihy , M. , Lev , Y. , Luchangco , V. , and Shavit , N . A provably correct scalable concurrent skip list . In OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems (December 2006 ). Herlihy, M., Lev, Y., Luchangco, V., and Shavit, N. A provably correct scalable concurrent skip list. In OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems (December 2006)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June","author":"Hicks M.","year":"2006","unstructured":"Hicks , M. , Foster , J. S. , and Prattikakis , P . Lock inference for atomic sections . In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006 ). Hicks, M., Foster, J. S., and Prattikakis, P. Lock inference for atomic sections. In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289586"},{"key":"e_1_3_2_1_26_1","volume-title":"Tree locking on changing trees. Tech. rep","author":"Lanin V.","year":"1990","unstructured":"Lanin , V. , and Shasha , D . Tree locking on changing trees. Tech. rep ., 1990 . Lanin, V., and Shasha, D. Tree locking on changing trees. Tech. rep., 1990."},{"key":"e_1_3_2_1_27_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-540-45099-3_15","volume-title":"Saskatchewan","author":"Lev-Ami T.","year":"2000","unstructured":"Lev-Ami , T. , and Sagiv , M . TVLA: A framework for Kleene based static analysis . In Saskatchewan ( 2000 ), vol. 1824 of Lecture Notes in Computer Science , Springer-Verlag , pp. 280 -- 301 . Lev-Ami, T., and Sagiv, M. TVLA: A framework for Kleene based static analysis. In Saskatchewan (2000), vol. 1824 of Lecture Notes in Computer Science, Springer-Verlag, pp. 280--301."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111596.1111597"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111068"},{"key":"e_1_3_2_1_30_1","volume-title":"Poster at the 4th Workshop on Memory Performance Issues (WMPI-2006).","author":"Moss J. E. B.","year":"2006","unstructured":"Moss , J. E. B. Open Nested Transactions: Semantics and Support . In Poster at the 4th Workshop on Memory Performance Issues (WMPI-2006). February 2006 . Moss, J. E. B. Open Nested Transactions: Semantics and Support. In Poster at the 4th Workshop on Memory Performance Issues (WMPI-2006). February 2006."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302743"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/113413.113430"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1982.235885"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215004"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480913"},{"key":"e_1_3_2_1_38_1","volume-title":"Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery","author":"Weikum G.","year":"2001","unstructured":"Weikum , G. , and Vossen , G . Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 2001 . Weikum, G., and Vossen, G. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378584"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_36"}],"event":{"name":"SPLASH '11: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2048066.2048086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:31Z","timestamp":1750225711000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,22]]},"references-count":40,"alternative-id":["10.1145\/2048066.2048086","10.1145\/2048066"],"URL":"https:\/\/doi.org\/10.1145\/2048066.2048086","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2076021.2048086","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,10,22]]},"assertion":[{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}