{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:13:18Z","timestamp":1725768798325},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452482"},{"type":"electronic","value":"9783642452499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45249-9_13","type":"book-chapter","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T06:08:11Z","timestamp":1388642891000},"page":"197-211","source":"Crossref","is-referenced-by-count":2,"title":["Non-interference and Local Correctness in Transactional Memory"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1583991.1584015","volume-title":"Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"H. Attiya","year":"2009","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)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-24650-0_21","volume-title":"Algorithms and Architectures for Parallel Processing","author":"T. Crain","year":"2011","unstructured":"Crain, T., Imbs, D., Raynal, M.: Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011, Part I. LNCS, vol.\u00a07016, pp. 244\u2013257. Springer, Heidelberg (2011)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: Norec: streamlining stm by abolishing ownership records. In: PPOPP, pp. 67\u201378 (2010)","DOI":"10.1145\/1837853.1693464"},{"issue":"5","key":"13_CR4","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."},{"issue":"12","key":"13_CR5","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.\u00a021(12), 1793\u20131807 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"13_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":"13_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1345206.1345233","volume-title":"PPoPP 2008: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP 2008: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 175\u2013184. ACM, New York (2008)"},{"key":"13_CR8","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"},{"issue":"1","key":"13_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"},{"key":"13_CR10","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":"13_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/197917.198079","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994","author":"A. Israeli","year":"1994","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1994, pp. 151\u2013160. ACM, New York (1994)"},{"key":"13_CR12","unstructured":"Kuznetsov, P., Peri, S.: Non-interference and local correctness in transactional memory. CoRR, abs\/1211.6315 (2013)"},{"key":"13_CR13","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.\u00a07109, pp. 112\u2013127. Springer, Heidelberg (2011)"},{"issue":"4","key":"13_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 database updates. J. ACM\u00a026(4), 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-17679-1_9","volume-title":"Distributed Computing and Networking","author":"S. Peri","year":"2011","unstructured":"Peri, S., Vidyasankar, K.: Correctness of concurrent executions of closed nested transactions in transactional memory systems. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 95\u2013106. Springer, Heidelberg (2011)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-25959-3_30","volume-title":"Distributed Computing and Networking","author":"S. Peri","year":"2012","unstructured":"Peri, S., Vidyasankar, K.: An efficient scheduler for closed nested transactions that satisfies all-reads-consistency and non-interference. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol.\u00a07129, pp. 409\u2013423. Springer, Heidelberg (2012)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Spear, M.F., Michael, M.M., von Praun, C.: Ringstm: scalable transactions with a single atomic instruction. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 275\u2013284 (2008)","DOI":"10.1145\/1378533.1378583"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann (2002)","DOI":"10.1016\/B978-155860508-4\/50005-3"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45249-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T18:59:21Z","timestamp":1558810761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45249-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642452482","9783642452499"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45249-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}