{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:57:55Z","timestamp":1725533875636},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026577"},{"type":"electronic","value":"9783642026584"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02658-4_1","type":"book-chapter","created":{"date-parts":[[2009,6,22]],"date-time":"2009-06-22T07:00:16Z","timestamp":1245654016000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Transactional Memory: Glimmer of a Theory"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Kapa\u0142ka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA (1993)","DOI":"10.1145\/165123.165164"},{"key":"1_CR2","volume-title":"Transaction Processing: Concepts and Techniques","author":"J. Gray","year":"1992","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1992)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC (1995)","DOI":"10.1145\/224964.224987"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: PODC (2003)","DOI":"10.1145\/872035.872048"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11561927_26","volume-title":"Distributed Computing","author":"V.J. Maranthe","year":"2005","unstructured":"Maranthe, V.J., Scherer III, W.N., Scott, M.L.: Adaptive software transactional memory. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 354\u2013368. Springer, Heidelberg (2005)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cachopo, J., Rito-Silva, A.: Versioned boxes as the basis for memory transactions. In: SCOOL (2005)","DOI":"10.1016\/j.scico.2006.05.009"},{"key":"1_CR7","unstructured":"Marathe, V.J., Spear, M.F., Heriot, C., Acharya, A., Eisenstat, D., Scherer III, W.N., Scott, M.L.: Lowering the overhead of software transactional memory. In: TRANSACT (2006)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Harris, T., Plesko, M., Shinnar, A., Tarditi, D.: Optimizing memory transactions. In: PLDI (2006)","DOI":"10.1145\/1133981.1133984"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11864219_13","volume-title":"Distributed Computing","author":"M.F. Spear","year":"2006","unstructured":"Spear, M.F., Marathe, V.J., Scherer III, W.N., Scott, M.L.: Conflict detection and validation strategies for software transactional memory. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 179\u2013193. Springer, Heidelberg (2006)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moir, M., Luchangco, V.: A flexible framework for implementing software transactional memory. In: OOPSLA (2006)","DOI":"10.1145\/1167473.1167495"},{"key":"1_CR11","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.\u00a04167, pp. 284\u2013298. Springer, Heidelberg (2006)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Adl-Tabatabai, A.R., Lewis, B.T., Menon, V., Murphy, B.R., Saha, B., Shpeisman, T.: Compiler and runtime support for efficient software transactional memory. In: PLDI (2006)","DOI":"10.1145\/1133981.1133985"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Shpeisman, T., Menon, V., Adl-Tabatabai, A.R., Balensiefer, S., Grossman, D., Hudson, R.L., Moore, K.F., Saha, B.: Enforcing isolation and ordering in STM. In: PLDI (2007)","DOI":"10.1145\/1250734.1250744"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Felber, P., Riegel, T., Fetzer, C.: Dynamic performance tuning of word-based software transactional memory. In: PPoPP (2008)","DOI":"10.1145\/1345206.1345241"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Harmanci, D., Felber, P.: Toward a theory of input acceptance for transactional memories. In: OPODIS (2008)","DOI":"10.1007\/978-3-540-92221-6_33"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Singh, A.V., Guerraoui, R., Singh, V.: Preventing versus curing: Avoiding conflicts in transactional memories. In: PODC (2009)","DOI":"10.1145\/1582716.1582725"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On the correctness of transactional memory. In: PPoPP (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On obstruction-free transactions. In: SPAA (2008)","DOI":"10.1145\/1378533.1378587"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: The semantics of progress in lock-based transactional memory. In: POPL (2009)","DOI":"10.1145\/1594834.1480931"},{"key":"1_CR20","unstructured":"Herlihy, M.: SXM software transactional memory package for C#, http:\/\/www.cs.brown.edu\/~mph"},{"key":"1_CR21","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)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2008)"},{"key":"1_CR23","unstructured":"Raynal, M., Imbs, D.: An STM lock-based protocol that satisfies opacity and progressiveness. In: OPODIS (2008)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Kapa\u0142ka, M.: Stretching transactional memory. In: PLDI (2009)","DOI":"10.1145\/1542476.1542494"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti, P.: Robust wait-free hierarchies. Journal of the ACM\u00a044(4), 592\u2013614 (1997)","journal-title":"Journal of the ACM"},{"issue":"3","key":"1_CR27","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 Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(3), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/63264.63518","volume":"11","author":"W.E. Weihl","year":"1989","unstructured":"Weihl, W.E.: Local atomicity properties: Modular concurrency control for abstract data types. ACM Transactions on Programming Languages and Systems\u00a011(2), 249\u2013282 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11561927_11","volume-title":"Distributed Computing","author":"H. Attiya","year":"2005","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC (1994)","DOI":"10.1145\/197917.198079"},{"issue":"11","key":"1_CR32","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in a database system. Commun. ACM\u00a019(11), 624\u2013633 (1976)","journal-title":"Commun. ACM"},{"key":"1_CR33","unstructured":"Dice, D., Shavit, N.: What really makes transactions fast? In: TRANSACT (2006)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Blundell, C., Lewis, E.C., Martin, M.M.K.: Subtleties of transactional memory atomicity semantics. IEEE Computer Architecture Letters\u00a05(2) (2006)","DOI":"10.1109\/L-CA.2006.18"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Scott, M.L., Scherer III, W.N.: Scalable queue-based spin locks with timeout. In: PPoPP (2001)","DOI":"10.1145\/379539.379566"},{"key":"1_CR36","volume-title":"Algorithms for Mutual Exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. MIT Press, Cambridge (1986)"},{"issue":"4","key":"1_CR37","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. Journal of the ACM\u00a026(4), 631\u2013653 (1979)","journal-title":"Journal of the ACM"},{"issue":"4","key":"1_CR38","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/319996.319998","volume":"8","author":"P.A. Bernstein","year":"1983","unstructured":"Bernstein, P.A., Goodman, N.: Multiversion concurrency control\u2014theory and algorithms. ACM Transactions on Database Systems\u00a08(4), 465\u2013483 (1983)","journal-title":"ACM Transactions on Database Systems"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Henzinger, T., Jobstmann, B., Singh, V.: Model checking transactional memories. In: PLDI (2008)","DOI":"10.1145\/1375581.1375626"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-85361-9_6","volume-title":"CONCUR 2008 - Concurrency Theory","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Completeness and nondeterminism in model checking transactional memorie. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 21\u201335. Springer, Heidelberg (2008)"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"O\u2019Leary, J., Saha, B., Tuttle, M.R.: Model checking transactional memory with Spin. In: ICDCS (2009)","DOI":"10.1109\/ICDCS.2009.72"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-24725-8_18","volume-title":"Programming Languages and Systems","author":"J. Vitek","year":"2004","unstructured":"Vitek, J., Jagannathan, S., Welc, A., Hosking, A.: A semantic framework for designer transactions. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 249\u2013263. Springer, Heidelberg (2004)"},{"issue":"2","key":"1_CR43","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.scico.2005.03.001","volume":"57","author":"S. Jagannathan","year":"2005","unstructured":"Jagannathan, S., Vitek, J., Welc, A., Hosking, A.: A transactional object calculus. Science of Computer Programming\u00a057(2), 164\u2013186 (2005)","journal-title":"Science of Computer Programming"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Abadi, M., Birrell, A., Harris, T., Isard, M.: Semantics of transactional memory and automatic mutual exclusion. In: POPL (2008)","DOI":"10.1145\/1328438.1328449"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Moore, K.F., Grossman, D.: High-level small-step operational semantics for transactions. In: POPL (2008)","DOI":"10.1145\/1328438.1328448"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Menon, V., Balensiefer, S., Shpeisman, T., Adl-Tabatabai, A.R., Hudson, R.L., Saha, B., Welc, A.: Practical weak-atomicity semantics for Java STM. In: SPAA (2008)","DOI":"10.1145\/1378533.1378588"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02658-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T21:19:50Z","timestamp":1558387190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02658-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026577","9783642026584"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02658-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}