{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:11:02Z","timestamp":1743091862226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147192"},{"type":"electronic","value":"9783319147208"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14720-8_3","type":"book-chapter","created":{"date-parts":[[2014,12,29]],"date-time":"2014-12-29T09:26:01Z","timestamp":1419845161000},"page":"50-71","source":"Crossref","is-referenced-by-count":0,"title":["Safety and Deferred Update in Transactional Memory"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Hans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters\u00a021(4), 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-662-45174-8_26","volume-title":"Distributed Computing","author":"H. Attiya","year":"2014","unstructured":"Attiya, H., Gotsman, A., Hans, S., Rinetzky, N.: Safety of live transactions in transactional memory: TMS is necessary and sufficient. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol.\u00a08784, pp. 376\u2013390. Springer, Heidelberg (2014)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hans, S., Kuznetsov, P., Ravi, S.: Safety of deferred update in transactional memory. In: ICDCS, pp. 601\u2013610 (2013)","DOI":"10.1109\/ICDCS.2013.57"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. Wiley Interscience (2004)","DOI":"10.1002\/0471478210"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00165-012-0225-8","volume":"25","author":"S. Doherty","year":"2013","unstructured":"Doherty, S., Groves, L., Luchangco, V., Moir, M.: Towards formally specifying and verifying transactional memory. Formal Asp. Comput.\u00a025(5), 769\u2013799 (2013)","journal-title":"Formal Asp. Comput."},{"key":"3_CR6","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.\u00a05218, pp. 305\u2013319. Springer, Heidelberg (2008)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: Principles of Transactional Memory, Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool (2010)","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"key":"3_CR8","series-title":"LNCS","first-page":"57","volume-title":"NETYS 2014","author":"R. Guerraoui","year":"2014","unstructured":"Guerraoui, R., Ruppert, E.: Linearizability is not always a safety property. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol.\u00a08539, pp. 57\u201369. Springer, Heidelberg (2014)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/42267.42272","volume":"35","author":"V. Hadzilacos","year":"1988","unstructured":"Hadzilacos, V.: A theory of reliability in database systems. J. ACM\u00a035(1), 121\u2013145 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR10","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. SIGARCH Comput. Archit. News\u00a021(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M.: Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations). Theor. Comput. Sci.\u00a0444 (July 2012)","DOI":"10.1016\/j.tcs.2012.04.037"},{"key":"3_CR13","unstructured":"K\u00f6nig, D.: Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad. Verlag (1936)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. CoRR, abs\/1103.1302 (2011)","DOI":"10.1007\/978-3-642-25873-2_9"},{"key":"3_CR15","unstructured":"Lesani, M., Luchangco, V., Moir, M.: Putting opacity in its place. In: WTTM (2012)"},{"key":"3_CR16","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S.S. Owicki","year":"1982","unstructured":"Owicki, S.S., Lamport, L.: Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Syst.\u00a04(3), 455\u2013495 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM\u00a026, 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC 1995, pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"}],"container-title":["Lecture Notes in Computer Science","Transactional Memory. Foundations, Algorithms, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14720-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:25:03Z","timestamp":1559082303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14720-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147192","9783319147208"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14720-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}