{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:17:50Z","timestamp":1743153470248,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319924076"},{"type":"electronic","value":"9783319924083"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92408-3_11","type":"book-chapter","created":{"date-parts":[[2018,5,26]],"date-time":"2018-05-26T17:08:42Z","timestamp":1527354522000},"page":"231-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting Transactional Memory with Stricter Serializability"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Sutra","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Marlier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1493-6603","authenticated-orcid":false,"given":"Valerio","family":"Schiavoni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7329-1812","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Trahay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-33651-5_21","volume-title":"Distributed Computing","author":"Y Afek","year":"2012","unstructured":"Afek, Y., Matveev, A., Shavit, N.: Pessimistic software lock-elision. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 297\u2013311. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_21"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00224-012-9406-3","volume":"51","author":"H Attiya","year":"2012","unstructured":"Attiya, H., Hillel, E.: A single-version STM that is multi-versioned permissive. Theory Comput. Syst. 51(4), 425\u2013446 (2012). https:\/\/doi.org\/10.1007\/s00224-012-9406-3","journal-title":"Theory Comput. Syst."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 69\u201378. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1583991.1584015","DOI":"10.1145\/1583991.1584015"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-69355-0_12","volume-title":"Structural Information and Communication Complexity","author":"H Avni","year":"2008","unstructured":"Avni, H., Shavit, N.: Maintaining consistent transactional states without a global clock. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 131\u2013140. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69355-0_12"},{"key":"11_CR5","unstructured":"Bernstein, P.A., Goodman, N.: Timestamp-based algorithms for concurrency control in distributed database systems. In: Proceedings of the 6th International Conference on Very Large Data Bases, pp. 285\u2013300, October 1980. http:\/\/dl.acm.org\/citation.cfm?id=1286887.1286918"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Cerone, A., Gotsman, A.: Analysing snapshot isolation. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25\u201328 July 2016, pp. 55\u201364 (2016). https:\/\/doi.org\/10.1145\/2933057.2933096","DOI":"10.1145\/2933057.2933096"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Chan, K., Wang, C.L.: TrC-MC: decentralized software transactional memory for multi-multicore computers. In: 2011 IEEE 17th International Conference on Parallel and Distributed Systems (ICPADS), pp. 292\u2013299 (2011). https:\/\/doi.org\/10.1109\/ICPADS.2011.144","DOI":"10.1109\/ICPADS.2011.144"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11864219_14","volume-title":"Distributed Computing","author":"D Dice","year":"2006","unstructured":"Dice, D., Shalev, O., Shavit, N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194\u2013208. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_14"},{"key":"11_CR9","unstructured":"Dice, D., Shavit, N.: What really makes transactions faster. In: Proceedings of the 1st TRANSACT 2006 Workshop, vol. 8, p. 3 (2006)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Diegues, N., Romano, P.: Time-warp: lightweight abort minimization in transactional memory. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014, pp. 167\u2013178. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2555243.2555259","DOI":"10.1145\/2555243.2555259"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/1924421.1924440","volume":"54","author":"A Dragojevi\u0107","year":"2011","unstructured":"Dragojevi\u0107, A., Felber, P., Gramoli, V., Guerraoui, R.: Why STM can be more than a research toy. Commun. ACM 54(4), 70\u201377 (2011). https:\/\/doi.org\/10.1145\/1924421.1924440","journal-title":"Commun. ACM"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00446-015-0261-8","volume":"29","author":"F Ellen","year":"2016","unstructured":"Ellen, F., Fatourou, P., Kosmas, E., Milani, A., Travers, C.: Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distrib. Comput. 29(4), 251\u2013277 (2016). https:\/\/doi.org\/10.1007\/s00446-015-0261-8","journal-title":"Distrib. Comput."},{"key":"11_CR13","unstructured":"Ennals, R.: Software transactional memory should not be obstruction-free. Technical report, Technical Report IRC-TR-06-052, Intel Research Cambridge Tech Report (2006)"},{"issue":"12","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TPDS.2010.49","volume":"21","author":"P Felber","year":"2010","unstructured":"Felber, P., Fetzer, C., Marlier, P., Riegel, T.: Time-based software transactional memory. IEEE Trans. Parallel Distrib. Syst. 21(12), 1793\u20131807 (2010). https:\/\/doi.org\/10.1109\/TPDS.2010.49","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Fernandes, S.M., Cachopo, J.a.: Lock-free and scalable multi-version software transactional memory. In: Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2011, pp. 179\u2013188. ACM, New York (2011). https:\/\/doi.org\/10.1145\/1941553.1941579","DOI":"10.1145\/1941553.1941579"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87779-0_21","volume-title":"Distributed Computing","author":"R Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 305\u2013319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_21"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2008, pp. 175\u2013184. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1345206.1345233","DOI":"10.1145\/1345206.1345233"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2008, pp. 175\u2013184. ACM, New York (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp. 404\u2013415. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1480881.1480931","DOI":"10.1145\/1480881.1480931"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-662-53426-7_20","volume-title":"Distributed Computing","author":"S Hans","year":"2016","unstructured":"Hans, S., Hassan, A., Palmieri, R., Peluso, S., Ravindran, B.: Opacity vs TMS2: expectations and reality. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 269\u2013283. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_20"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Harris, T., Fraser, K.: Revocable locks for non-blocking programming. In: Proceedings of the Tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2005, pp. 72\u201382. ACM, New York (2005). https:\/\/doi.org\/10.1145\/1065944.1065954","DOI":"10.1145\/1065944.1065954"},{"issue":"8","key":"11_CR22","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/2692916.2555283","volume":"49","author":"A Hassan","year":"2014","unstructured":"Hassan, A., Palmieri, R., Ravindran, B.: Optimistic transactional boosting. SIGPLAN Not. 49(8), 387\u2013388 (2014). https:\/\/doi.org\/10.1145\/2692916.2555283","journal-title":"SIGPLAN Not."},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 92\u2013101. ACM, New York (2003). https:\/\/doi.org\/10.1145\/872035.872048","DOI":"10.1145\/872035.872048"},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 59\u201368. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1583991.1584013","DOI":"10.1145\/1583991.1584013"},{"key":"11_CR26","unstructured":"Kuznetsov, P., Ravi, S.: Why transactional memory should not be obstruction-free. CoRR abs\/1502.02725 (2015)"},{"issue":"5","key":"11_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2006.180","volume":"39","author":"EA Lee","year":"2006","unstructured":"Lee, E.A.: The problem with threads. Computer 39(5), 33\u201342 (2006). https:\/\/doi.org\/10.1109\/MC.2006.180","journal-title":"Computer"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Nguyen, D., Pingali, K.: What scalable programs need from transactional memory. In: Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2017, pp. 105\u2013118. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3037697.3037750","DOI":"10.1145\/3037697.3037750"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-24100-0_9","volume-title":"Distributed Computing","author":"D Perelman","year":"2011","unstructured":"Perelman, D., Byshevsky, A., Litmanovich, O., Keidar, I.: SMV: selective multi-versioning STM. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 125\u2013140. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_9"},{"key":"11_CR30","unstructured":"Ravi, S.: Lower bounds for transactional memory. Bull. EATCS 121 (2017)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11864219_20","volume-title":"Distributed Computing","author":"T Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 284\u2013298. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_20"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11864219_13","volume-title":"Distributed Computing","author":"MF Spear","year":"2006","unstructured":"Spear, M.F., Marathe, V.J., Scherer, W.N., Scott, M.L.: Conflict detection and validation strategies for software transactional memory. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 179\u2013193. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_13"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Zhang, R., Budimli\u0107, Z., Scherer, III, W.N.: Commit phase in timestamp-based STM. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 326\u2013335. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1378533.1378589","DOI":"10.1145\/1378533.1378589"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92408-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:28:32Z","timestamp":1654734512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92408-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319924076","9783319924083"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92408-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.discotec.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}