{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:52:15Z","timestamp":1762458735497},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_26","type":"book-chapter","created":{"date-parts":[[2009,6,22]],"date-time":"2009-06-22T11:00:16Z","timestamp":1245668416000},"page":"321-336","source":"Crossref","is-referenced-by-count":20,"title":["Software Transactional Memory on Relaxed Memory Models"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasu","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"26_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. IEEE Computer\u00a029(12), 66\u201376 (1996)","journal-title":"IEEE Computer"},{"key":"26_CR2","first-page":"12","volume-title":"PLDI","author":"S. Burckhardt","year":"2007","unstructured":"Burckhardt, S., Alur, R., Martin, M.M.K.: CheckFence: Checking consistency of concurrent data types on relaxed memory models. In: PLDI, pp. 12\u201321. ACM, New York (2007)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70545-1_13","volume-title":"Computer Aided Verification","author":"A. Cohen","year":"2008","unstructured":"Cohen, A., Pnueli, A., Zuck, L.D.: Mechanical verification of transactional memories with non-transactional memory accesses. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 121\u2013134. Springer, Heidelberg (2008)"},{"key":"26_CR4","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":"26_CR5","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. In: Formal Methods in System Design, pp. 105\u2013131 (1996)","DOI":"10.1007\/BF00625970"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/1375581.1375626","volume-title":"PLDI","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Jobstmann, B., Singh, V.: Model checking transactional memories. In: PLDI, pp. 372\u2013382. ACM, New York (2008)"},{"key":"26_CR7","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.: Nondeterminism and completeness in transactional memories. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 21\u201335. Springer, Heidelberg (2008)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1345206.1345233","volume-title":"PPoPP","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP, pp. 175\u2013184. ACM, New York (2008)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48683-6_27","volume-title":"Computer Aided Verification","author":"T.A. Henzinger","year":"1999","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Verifying sequential consistency on shared-memory multiprocessor systems. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 301\u2013315. Springer, Heidelberg (1999)"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/872035.872048","volume-title":"PODC","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N.: Software transactional memory for dynamic-sized data structures. In: PODC, pp. 92\u2013101. ACM, New York (2003)"},{"key":"26_CR11","first-page":"289","volume-title":"ISCA","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300. ACM, New York (1993)"},{"issue":"9","key":"26_CR12","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Computers\u00a028(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Computers"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11888116_2","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"L. Lamport","year":"2006","unstructured":"Lamport, L.: The $^{\\mbox{+}}$ CAL algorithm language. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol.\u00a04229, p. 23. Springer, Heidelberg (2006)"},{"issue":"8","key":"26_CR14","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/12.947002","volume":"50","author":"J. Lee","year":"2001","unstructured":"Lee, J., Padua, D.A.: Hiding relaxed memory consistency with a compiler. IEEE Trans. Computers\u00a050(8), 824\u2013833 (2001)","journal-title":"IEEE Trans. Computers"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Manovit, C., Hangal, S., Chafi, H., McDonald, A., Kozyrakis, C., Olukotun, K.: Testing implementations of transactional memory. In: PACT, pp. 134\u2013143 (2006)","DOI":"10.1145\/1152154.1152177"},{"key":"26_CR16","first-page":"378","volume-title":"POPL","author":"J. Manson","year":"2005","unstructured":"Manson, J., Pugh, W., Adve, S.V.: The Java memory model. In: POPL, pp. 378\u2013391. ACM, New York (2005)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. Journal of the ACM\u00a026(4) (1979)","DOI":"10.1145\/322154.322158"},{"key":"26_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/1122971.1123001","volume-title":"PPOPP","author":"B. Saha","year":"2006","unstructured":"Saha, B., Adl-Tabatabai, A., Hudson, R.L., Minh, C.C., Hertzberg, B.: McRT-STM: A high performance software transactional memory system for a multi-core runtime. In: PPOPP, pp. 187\u2013197. ACM, New York (2006)"},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1145\/224964.224987","volume-title":"PODC","author":"N. Shavit","year":"1995","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: PODC, pp. 204\u2013213. ACM, New York (1995)"},{"volume-title":"The SPARC Architecture Manual (version 9)","year":"1994","key":"26_CR20","unstructured":"Weaver, D., Germond, T. (eds.): The SPARC Architecture Manual (version 9). Prentice-Hall, Inc., Englewood Cliffs (1994)"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T19:18:54Z","timestamp":1685042334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02658-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026577","9783642026584"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02658-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}