{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:14:59Z","timestamp":1743023699316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319082592"},{"type":"electronic","value":"9783319082608"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08260-8_3","type":"book-chapter","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T07:13:31Z","timestamp":1403594011000},"page":"29-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Behaviour of General-Purpose Applications on Cloud Storages"],"prefix":"10.1007","author":[{"given":"Laura","family":"Bocchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hern\u00e1n","family":"Melgratti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,25]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s10703-011-0135-z","volume":"40","author":"J Alglave","year":"2012","unstructured":"Alglave, J., Maranget, L., Sarkar, S., Sewell, P.: Fences in weak memory models (extended version). Formal Methods Syst. Des. 40(2), 170\u2013205 (2012)","journal-title":"Formal Methods Syst. Des."},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/2447976.2447992","volume":"56","author":"P Bailis","year":"2013","unstructured":"Bailis, P., Ghodsi, A.: Eventual consistency today: limitations, extensions, and beyond. Commun. ACM 56(5), 55\u201363 (2013)","journal-title":"Commun. ACM"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Boudol, G., Petri, G.: Relaxed memory models: an operational approach. In: Shao,\u00a0Z., Pierce, B.C. (ed.) POPL, pp. 392\u2013403. ACM (2009)","DOI":"10.1145\/1594834.1480930"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-31057-7_14","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"S Burckhardt","year":"2012","unstructured":"Burckhardt, S., F\u00e4hndrich, M., Leijen, D., Wood, B.P.: Cloud types for eventual consistency. In: Noble, J. (ed.) ECOOP 2012. LNCS, vol. 7313, pp. 283\u2013307. Springer, Heidelberg (2012)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-28869-2_4","volume-title":"Programming Languages and Systems","author":"S Burckhardt","year":"2012","unstructured":"Burckhardt, S., Leijen, D., F\u00e4hndrich, M., Sagiv, M.: Eventually consistent transactions. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 67\u201386. Springer, Heidelberg (2012)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"G DeCandia","year":"2007","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon\u2019s highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6), 205\u2013220 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Goto, M., Jagadeesan, R., Ptcher, C., Riely, J.: Types for relaxed memory models. In: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, TLDI \u201912, pp. 25\u201338. ACM, New York (2012)","DOI":"10.1145\/2103786.2103791"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Kraska, T., Loesing, S.: An evaluation of alternative architectures for transaction processing in the cloud. In: Elmagarmid, A.K., Agrawal, D. (ed.) SIGMOD Conference, pp. 579\u2013590. ACM (2010)","DOI":"10.1145\/1807167.1807231"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/PL00008921","volume":"13","author":"L Lamport","year":"2000","unstructured":"Lamport, L.: Fairness and hyperfairness. Distrib. Comput. 13(4), 239\u2013245 (2000)","journal-title":"Distrib. Comput."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","year":"2012","unstructured":"Madhusudan, P., Seshia, Sanjit A. (eds.): CAV 2012. LNCS, vol. 7358. Springer, Heidelberg (2012)"},{"key":"3_CR12","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1982","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer-Verlag New York Inc., Secaucus (1982)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/1394127.1394128","volume":"6","author":"D Pritchett","year":"2008","unstructured":"Pritchett, D.: Base: an acid alternative. Queue 6(3), 48\u201355 (2008)","journal-title":"Queue"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15057-9_4","volume-title":"Verified Software: Theories, Tools, Experiments","author":"T Ridge","year":"2010","unstructured":"Ridge, T.: A rely-guarantee proof system for x86-TSO. In: Leavens, G.T., O\u2019Hearn, P., Rajamani, S.K. (eds.) VSTTE 2010. LNCS, vol. 6217, pp. 55\u201370. Springer, Heidelberg (2010)"},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/2345156.1993520","volume":"47","author":"S Sarkar","year":"2011","unstructured":"Sarkar, S., Sewell, P., Alglave, J., Maranget, L., Williams, D.: Understanding power multiprocessors. SIGPLAN Not. 47(6), 175\u2013186 (2011)","journal-title":"SIGPLAN Not."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Sevc\u00edk, J., Vafeiadis, V., Nardelli, F.Z., Jagannathan, S., Sewell, P.: Relaxed-memory concurrency and verified compilation. In: Ball, T., Sagiv, M. (ed.) POPL, pp. 43\u201354. ACM (2011)","DOI":"10.1145\/1925844.1926393"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2487241.2487248","volume":"60","author":"J Sevc\u00edk","year":"2013","unstructured":"Sevc\u00edk, J., Vafeiadis, V., Nardelli, F.Z., Jagannathan, S., Sewell, P.: Compcerttso: a verified compiler for relaxed-memory concurrency. J. ACM 60(3), 22 (2013)","journal-title":"J. ACM"},{"issue":"7","key":"3_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1785414.1785443","volume":"53","author":"P Sewell","year":"2010","unstructured":"Sewell, P., Sarkar, S., Owens, S., Nardelli, F.Z., Myreen, M.O.: x86-tso: a rigorous and usable programmer\u2019s model for x86 multiprocessors. Commun. ACM 53(7), 89\u201397 (2010)","journal-title":"Commun. ACM"},{"key":"3_CR19","volume-title":"Encyclopedia of Database Systems (Online and Print)","author":"M Shapiro","year":"2009","unstructured":"Shapiro, M., Kemme, B.: Eventual consistency. In: \u00d6zsu, M.T., Liu, L. (eds.) Encyclopedia of Database Systems (Online and Print). Springer, New York (2009)"},{"key":"3_CR20","volume-title":"Distributed Systems - Principles and Paradigms","author":"AS Tanenbaum","year":"2007","unstructured":"Tanenbaum, A.S., van Steen, M.: Distributed Systems - Principles and Paradigms, 2nd edn. Pearson Education, Upper Saddle River (2007)","edition":"2"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1435417.1435432","volume":"52","author":"W Vogels","year":"2009","unstructured":"Vogels, W.: Eventually consistent. Commun. ACM 52(1), 40\u201344 (2009)","journal-title":"Commun. ACM"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"von Gleissenthall, K., Rybalchenko, A.: An epistemic perspective on consistency of concurrent computations. CoRR, abs\/1305.2295 (2013)","DOI":"10.1007\/978-3-642-40184-8_16"}],"container-title":["Lecture Notes in Computer Science","Web Services and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08260-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T23:59:05Z","timestamp":1675814345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08260-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319082592","9783319082608"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08260-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}