{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:56:00Z","timestamp":1725569760013},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642166112"},{"type":"electronic","value":"9783642166129"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16612-9_32","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T11:45:14Z","timestamp":1289994314000},"page":"421-435","source":"Crossref","is-referenced-by-count":1,"title":["Runtime Verification for Software Transactional Memories"],"prefix":"10.1007","author":[{"given":"Vasu","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"32_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"32_CR2","unstructured":"Minh, C.C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: Proceedings of The IEEE International Symposium on Workload Characterization (September 2008)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Chen, K., Malik, S., Patra, P.: Runtime validation of transactional memory systems. In: International Symposium on Quality Electronic Design, pp. 750\u2013756 (2008)","DOI":"10.1109\/ISQED.2008.4479832"},{"key":"32_CR4","first-page":"37","volume-title":"International Conference on Fomal Methods in Computer Aided Design","author":"A. Cohen","year":"2007","unstructured":"Cohen, A., O\u2019Leary, J., Pnueli, A., Tuttle, M.R., Zuck, L.: Verifying correctness of transactional memories. In: International Conference on Fomal Methods in Computer Aided Design, pp. 37\u201344. IEEE Computer Society, Los Alamitos (2007)"},{"key":"32_CR5","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":"32_CR6","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.N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Elmas, T., Qadeer, S., Tasiran, S.: Goldilocks: A race and transaction-aware Java runtime. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 245\u2013255 (2007)","DOI":"10.1145\/1250734.1250762"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-70545-1_8","volume-title":"Computer Aided Verification","author":"A. Farzan","year":"2008","unstructured":"Farzan, A., Madhusudan, P.: Monitoring atomicity in concurrent programs. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 52\u201365. Springer, Heidelberg (2008)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: Atomizer: A dynamic atomicity checker for multithreaded programs. In: ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 256\u2013267 (2004)","DOI":"10.1145\/964001.964023"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: FastTrack: Efficient and precise dynamic race detection. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 121\u2013133 (2009)","DOI":"10.1145\/1542476.1542490"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N., Yi, J.: Velodrome: A sound and complete dynamic atomicity checker for multithreaded programs. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 293\u2013303 (2008)","DOI":"10.1145\/1375581.1375618"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/1375581.1375626","volume-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Jobstmann, B., Singh, V.: Model checking transactional memories. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 372\u2013382. ACM, New York (2008)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","first-page":"21","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Guerraoui","year":"2000","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Nondeterminism and completeness in model checking transactional memories. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 21\u201335. Springer, Heidelberg (2000)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-02658-4_26","volume-title":"Computer Aided Verification","author":"R. Guerraoui","year":"2009","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Software transactional memory on relaxed memory models. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 321\u2013336. Springer, Heidelberg (2009)"},{"key":"32_CR15","first-page":"175","volume-title":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On the correctness of transactional memory. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 175\u2013184. ACM, New York (2008)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Hadzilacos, T., Yannakakis, M.: Deleting completed transactions. In: ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 43\u201346 (1986)","DOI":"10.1145\/6012.15402"},{"key":"32_CR17","first-page":"92","volume-title":"ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N.: Software transactional memory for dynamic-sized data structures. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 92\u2013101. ACM, New York (2003)"},{"key":"32_CR18","first-page":"289","volume-title":"International Symposium on Computer Architecture","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: International Symposium on Computer Architecture, pp. 289\u2013300. ACM, New York (1993)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Manovit, C., Hangal, S., Chafi, H., McDonald, A., Kozyrakis, C., Olukotun, K.: Testing implementations of transactional memory. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 134\u2013143 (2006)","DOI":"10.1145\/1152154.1152177"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. Journal of the ACM 26(4) (1979)","DOI":"10.1145\/322154.322158"},{"issue":"4","key":"32_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1145\/265924.265927","volume":"15","author":"S. Savage","year":"1997","unstructured":"Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., Anderson, T.E.: Eraser: A dynamic data race detector for multithreaded programs. ACM Trans. Comput. Syst.\u00a015(4), 391\u2013411 (1997)","journal-title":"ACM Trans. Comput. Syst."},{"key":"32_CR22","unstructured":"Scott, M.L.: Sequential specification of transactional memory semantics. In: ACM SIGPLAN Workshop on Transactional Computing (2006)"},{"key":"32_CR23","first-page":"204","volume-title":"ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","author":"N. Shavit","year":"1995","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 204\u2013213. ACM, New York (1995)"},{"key":"32_CR24","unstructured":"Tasiran, S.: A compositional method for verifying software transactional memory implementations. Technical Report MSR-TR-2008-56, Microsoft Research (2008)"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16612-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T17:19:37Z","timestamp":1636823977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16612-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642166112","9783642166129"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16612-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}