{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:33:39Z","timestamp":1725824019750},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_20","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T03:46:47Z","timestamp":1434685607000},"page":"247-259","source":"Crossref","is-referenced-by-count":1,"title":["From Sequential Specifications to Eventual Consistency"],"prefix":"10.1007","author":[{"given":"Radha","family":"Jagadeesan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Riely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Enea, C., Hamza, J.: Verifying eventual consistency of optimistic replication systems. In POPL 2014, pp. 285\u2013296 (2014)","key":"20_CR1","DOI":"10.1145\/2535838.2535877"},{"doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: POPL 2014, pp. 271\u2013284 (2014)","key":"20_CR2","DOI":"10.1145\/2535838.2535848"},{"key":"20_CR3","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.) Programming Languages and Systems. LNCS, vol. 7211, pp. 67\u201386. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Conway, N., Marczak, W.R. et al.: Logic and lattices for distributed programming. In: ACM Symposium on Cloud Computing, pp. 1:1\u20131:14 (2012)","key":"20_CR4","DOI":"10.21236\/ADA563903"},{"doi-asserted-by":"crossref","unstructured":"Derrick, J., Dongol, B., et al.: Quiescent consistency: defining and verifying relaxed linearizability. In: Formal, Methods, pp. 200\u2013214 (2014)","key":"20_CR5","DOI":"10.1007\/978-3-319-06410-9_15"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1145\/66926.66963","volume":"18","author":"CA Ellis","year":"1989","unstructured":"Ellis, C.A., Gibbs, S.J.: Concurrency control in groupware systems. ACM SIGMOD Record 18(2), 399\u2013407 (1989)","journal-title":"ACM SIGMOD Record"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1016\/j.tcs.2010.09.021","volume":"411","author":"I Filipovic","year":"2010","unstructured":"Filipovic, I., O\u2019Hearn, P.W., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. Theoretical Comp. Sci. 411, 4379\u20134398 (2010)","journal-title":"Theoretical Comp. Sci."},{"doi-asserted-by":"crossref","unstructured":"Gilbert, S., Lynch, N.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, pp. 51\u201359 (2002)","key":"20_CR8","DOI":"10.1145\/564585.564601"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-46669-8_24","volume-title":"Programming Languages and Systems","author":"A Gotsman","year":"2015","unstructured":"Gotsman, A., Yang, H.: Composite replicated data types. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 585\u2013609. Springer, Heidelberg (2015)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1860702.1860704","volume":"39","author":"JM Hellerstein","year":"2010","unstructured":"Hellerstein, J.M.: The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Rec. 39(1), 5\u201319 (2010)","journal-title":"SIGMOD Rec."},{"issue":"3","key":"20_CR11","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 TOPLAS 12(3), 463\u2013492 (1990)","journal-title":"ACM TOPLAS"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-662-43951-7_19","volume-title":"Automata, Languages, and Programming","author":"R Jagadeesan","year":"2014","unstructured":"Jagadeesan, R., Riely, J.: Between linearizability and quiescent consistency. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 220\u2013231. Springer, Heidelberg (2014)"},{"issue":"7","key":"20_CR13","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Panangaden, P., Shanbhogue, V., Stark, E.W.: Stability and sequentiality in dataflow networks. In: ICALP 1990, pp. 308\u2013321 (1990)","key":"20_CR14","DOI":"10.1007\/BFb0032041"},{"doi-asserted-by":"crossref","unstructured":"Panangaden, P., Stark, E.W.: Computations, residuals, and the power of indeterminacy. In: ICALP 1988, pp. 439\u2013454 (1988)","key":"20_CR15","DOI":"10.1007\/3-540-19488-6_133"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/1057977.1057980","volume":"37","author":"Y Saito","year":"2005","unstructured":"Saito, Y., Shapiro, M.: Optimistic replication. Comput. Surv. 37(1), 42\u201381 (2005)","journal-title":"Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: A comprehensive study of Convergent and Commutative Replicated Data Types. TR 7506, Inria (2011)","key":"20_CR17","DOI":"10.1007\/978-3-642-24550-3_29"},{"doi-asserted-by":"crossref","unstructured":"Terry, D.B., Theimer, M.M. et al.: Managing update conflicts in bayou, a weakly connected replicated storage system. In: SOSP (1995)","key":"20_CR18","DOI":"10.1145\/224056.224070"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1435417.1435432","volume":"52","author":"W Vogels","year":"2009","unstructured":"Vogels, W.: Eventually consistent. Communications of the ACM 52(1), 40\u201344 (2009)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T03:11:19Z","timestamp":1559185879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}