{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:10:07Z","timestamp":1746400207108,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319099668"},{"type":"electronic","value":"9783319099675"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09967-5_19","type":"book-chapter","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T15:10:04Z","timestamp":1412089804000},"page":"325-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combining Lock Inference with Lock-Based Software Transactional Memory"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kempf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Veldema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Philippsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: PPoPP\u201910: Proceedings of the Symposium on Principles and Practice Parallel Programming, Bangalore, India, pp. 257\u2013268, Jan 2010","DOI":"10.1145\/1837853.1693488"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: Transactional predication: high-performance concurrent sets and maps for STM. In: PODC\u201910: Proceedings of the Symposium on Principles of Distributed Computing, Zurich, Switzerland, pp. 6\u201315, Jul 2010","DOI":"10.1145\/1835698.1835703"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: stanford transactional applications for multi-processing. In: Proceedings of the Symposium on Workload Characterization (IISWC\u201908), Seattle, WA, pp. 35\u201346, Sep 2008","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Kapalka, M.: Stretching transactional memory. In: PLDI \u201909: Proceedings of the Conference on Programming Language Design and Implementation, Dublin, Ireland, pp. 155\u2013165, June 2009","DOI":"10.1145\/1543135.1542494"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: PODC\u201904: Proceedings of the Symposium on Principles of Distributed Computing, St. John\u2019s, Newfoundland, Canada, pp. 50\u201359, Jul 2004","DOI":"10.1145\/1011767.1011776"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Golan-Gueta, G., Bronson, N., Aiken, A., Ramalingam, G., Sagiv, M., Yahav, E.: Automatic fine-grain locking using shape properties. In: OOPSLA\u201911: Proceedings of the International Conference on Object Oriented Programming Systems Languages and Applications, Portland, OR, pp. 225\u2013242, Oct 2011","DOI":"10.1145\/2076021.2048086"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-31057-7_15","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"K Gudka","year":"2012","unstructured":"Gudka, K., Harris, T., Eisenbach, S.: Lock inference in the presence of large libraries. In: Noble, J. (ed.) ECOOP 2012. LNCS, vol. 7313, pp. 308\u2013332. Springer, Heidelberg (2012)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: PPoPP\u201908: Proceedings of the Symposium on Principles and Practice Parallel Programming, Salt Lake City, UT, pp. 207\u2013216, Feb 2008","DOI":"10.1145\/1345206.1345237"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"M Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. ACM SIGARCH Comput. Archit. News 21(2), 289\u2013300 (1993)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"19_CR10","unstructured":"Hicks, M., Foster, J.S., Prattikakis, P.: Lock inference for atomic sections. In: Proceedings of the Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT\u201906), Ottawa, Canada, pp. 304\u2013315, June 2006"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P.: Optimistic parallelism requires abstractions. In: PLDI \u201907: Proceedings of the Conference on Programming Language Design and Implementation, PLDI \u201907, San Diego, CA, pp. 211\u2013222, June 2007","DOI":"10.1145\/1273442.1250759"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis and transformation. In: CGO\u201904: Proceedings of the International Symposium on Code Generation and Optimization, Palo Alto, CA, pp. 75\u201385, March 2004","DOI":"10.1109\/CGO.2004.1281665"},{"issue":"6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"MM Michael","year":"2004","unstructured":"Michael, M.M.: Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 15(6), 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/12.88484","volume":"40","author":"JH Saltz","year":"1991","unstructured":"Saltz, J.H., Mirchandaney, R., Crowley, K.: Run-time parallelization and scheduling of loops. IEEE Trans. Comput. 40(5), 603\u2013612 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Usui, T., Behrends, R., Evans, J., Smaragdakis, Y.: Adaptive locks: Combining transactions and locks for efficient concurrency. In: PACT\u201909: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, Raleigh, NC, pp. 3\u201314, Sep 2009","DOI":"10.1109\/PACT.2009.20"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Wamhoff, J.T., Fetzer, C., Felber, P., Rivi\u00e8re, E., Muller, G.: FastLane: improving performance of software transactional memory for low thread counts. In: PPoPP\u201913: Proceedings of the Symposium on Principles and Practice Parallel Programming, Shenzhen, China, pp. 113\u2013122, Feb 2013","DOI":"10.1145\/2517327.2442528"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-89740-8_10","volume-title":"Languages and Compilers for Parallel Computing","author":"Y Zhang","year":"2008","unstructured":"Zhang, Y., Sreedhar, V.C., Zhu, W., Sarkar, V., Gao, G.R.: Minimum lock assignment: a method for exploiting concurrency among critical sections. In: Amaral, J.N. (ed.) LCPC 2008. LNCS, vol. 5335, pp. 141\u2013155. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09967-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T22:57:06Z","timestamp":1746399426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09967-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319099668","9783319099675"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09967-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}