{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:59Z","timestamp":1760202779842,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030055288"},{"type":"electronic","value":"9783030055295"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05529-5_11","type":"book-chapter","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:54:08Z","timestamp":1546638848000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems"],"prefix":"10.1007","author":[{"given":"Sathya","family":"Peri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Archit","family":"Somani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,5]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"crossref","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. SIGARCH Comput. Archit. News 21(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC, pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Harris, T., Marlow, S., Peyton-Jones, S., Herlihy, M.: Composable memory transactions. In: PPOPP, New York, NY, USA, pp. 48\u201360. ACM (2005)","DOI":"10.1145\/1065944.1065952"},{"key":"11_CR4","volume-title":"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery","author":"G Weikum","year":"2002","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, Burlington (2002)"},{"key":"11_CR5","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2012","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Elsevier Science, Amsterdam (2012)"},{"issue":"4","key":"11_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1142\/S0129626407003125","volume":"17","author":"S Heller","year":"2007","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. Parallel Process. Lett. 17(4), 411\u2013424 (2007)","journal-title":"Parallel Process. Lett."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPOPP, pp. 175\u2013184. ACM (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"11_CR8","unstructured":"Peri, S., Singh, A., Somani, A.: Efficient means of achieving composability using transactional memory. CoRR abs\/1709.00681 (2017)"},{"key":"11_CR9","unstructured":"Harris, T., et al.: Abstract nested transactions (2007)"},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.tcs.2016.06.021","volume":"688","author":"P Kuznetsov","year":"2017","unstructured":"Kuznetsov, P., Peri, S.: Non-interference and local correctness in transactional memory. Theory Comput. Sci. 688, 103\u2013116 (2017)","journal-title":"Theory Comput. Sci."},{"issue":"C","key":"11_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.jpdc.2016.10.010","volume":"100","author":"P Felber","year":"2017","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. J. Parallel Distrib. Comput. 100(C), 103\u2013127 (2017)","journal-title":"J. Parallel Distrib. Comput."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, D., Dechev, D.: Lock-free transactions without rollbacks for linked data structures. In: SPAA 2016, New York, NY, USA, pp. 325\u2013336. ACM (2016)","DOI":"10.1145\/2935764.2935780"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: NOrec: streamlining STM by abolishing ownership records. In: Govindarajan, R., Padua, D.A., Hall, M.W., (eds.) PPOPP, pp. 67\u201378. ACM (2010)","DOI":"10.1145\/1693453.1693464"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: PPOPP, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1345206.1345237"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Ni, Y., et al.: Open nesting in software transactional memory. In: PPOPP. ACM (2007)","DOI":"10.1145\/1229428.1229442"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Hassan, A., Palmieri, R., Ravindran, B.: Optimistic transactional boosting. In: Moreira, J.E., Larus, J.R. (eds.) PPOPP, pp. 387\u2013388. ACM (2014)","DOI":"10.1145\/2555243.2555283"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Golan-Gueta, G., Keidar, I.: Transactional data structure libraries. In: PLDI, pp. 682\u2013696. ACM (2016)","DOI":"10.1145\/2908080.2908112"},{"issue":"2","key":"11_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1233307.1233309","volume":"25","author":"K Fraser","year":"2007","unstructured":"Fraser, K., Harris, T.: Concurrent programming without locks. ACM Trans. Comput. Syst. 25(2), 5 (2007)","journal-title":"ACM Trans. Comput. Syst."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-25873-2_9","volume-title":"Principles of Distributed Systems","author":"P Kuznetsov","year":"2011","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 112\u2013127. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_9"},{"issue":"3","key":"11_CR21","doi-asserted-by":"crossref","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)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05529-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T11:42:31Z","timestamp":1573645351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05529-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030055288","9783030055295"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05529-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Essaouira","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"9 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/history\/netys2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}