{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:11:40Z","timestamp":1725624700939},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246494"},{"type":"electronic","value":"9783642246500"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24650-0_21","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T10:08:55Z","timestamp":1319278135000},"page":"244-257","source":"Crossref","is-referenced-by-count":6,"title":["Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible"],"prefix":"10.1007","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Imbs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TSE.1979.234182","volume":"SE-5","author":"P.A. Bernstein","year":"1979","unstructured":"Bernstein, P.A., Shipman, D.W., Wong, W.S.: Formal Aspects of Serializability in Database Concurrency Control. IEEE Transactions on Software Engineering\u00a0SE-5(3), 203\u2013216 (1979)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Crain, T., Imbs, D., Raynal, M.: Read Invisibility, Virtual World Consistency and Permissiveness are Compatible. Tech Report #1958, IRISA, Univ. de Rennes 1, France (November 2010)","DOI":"10.1007\/978-3-642-24650-0_21"},{"key":"21_CR3","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.\u00a04167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/1360443.1360456","volume":"39","author":"P. Felber","year":"2008","unstructured":"Felber, P., Fetzer, C., Guerraoui, R., Harris, T.: Transactions are coming Back, but Are They The Same? ACM Sigact News, DC Column\u00a039(1), 48\u201358 (2008)","journal-title":"ACM Sigact News, DC Column"},{"key":"21_CR5","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":"21_CR6","first-page":"175","volume-title":"Proc. 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008)","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On the Correctness of Transactional Memory. In: Proc. 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008), pp. 175\u2013184. ACM Press, New York (2008)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MM.2007.63","volume":"27","author":"T. Harris","year":"2007","unstructured":"Harris, T., Cristal, A., Unsal, O.S., Ayguade, E., Gagliardi, F., Smith, B., Valero, M.: Transactional Memory: an Overview. IEEE Micro\u00a027(3), 8\u201329 (2007)","journal-title":"IEEE Micro"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/1360443.1360458","volume":"39","author":"M.P. Herlihy","year":"2008","unstructured":"Herlihy, M.P., Luchangco, V.: Distributed Computing and the Multicore Revolution. ACM SIGACT News, DC Column\u00a039(1), 62\u201372 (2008)","journal-title":"ACM SIGACT News, DC Column"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Herlihy, M.P., Moss, J.E.B.: Transactional Memory: Architectural Support for Lock-free Data Structures. In: Proc. 20th ACM Int\u2019l Symposium on Computer Archictecture (ISCA 1993), pp. 289\u2013300 (1993)","DOI":"10.1145\/165123.165164"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-92295-7_11","volume-title":"Distributed Computing and Networking","author":"D. Imbs","year":"2008","unstructured":"Imbs, D., Raynal, M.: Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol.\u00a05408, pp. 67\u201378. Springer, Heidelberg (2008)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-11476-2_21","volume-title":"Structural Information and Communication Complexity","author":"D. Imbs","year":"2010","unstructured":"Imbs, D., Raynal, M.: A versatile STM protocol with Invisible Read Operations that Satisfies the Virtual World Consistency Condition. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 266\u2013280. Springer, Heidelberg (2010)"},{"key":"21_CR13","unstructured":"Marathe, V.J., Spear, M.F., Heriot, C., Acharya, A., Eisentatt, D., Scherer III, W.N., Scott, M.L.: Lowering the Overhead of Software Transactional Memory. In: Proc. 1st ACM SIGPLAN Workshop on Languages, Compilers and Hardware Support for Transactional Computing, TRANSACT 2006 (2006)"},{"issue":"4","key":"21_CR14","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 Updates. Journal of the ACM\u00a026(4), 631\u2013653 (1979)","journal-title":"Journal of the ACM"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software Transactional Memory. Distributed Computing\u00a010(2), 99\u2013116 (1997)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24650-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T07:10:25Z","timestamp":1593155425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24650-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246494","9783642246500"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24650-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}