{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:18:51Z","timestamp":1725887931546},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_32","type":"book-chapter","created":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T02:53:30Z","timestamp":1494644010000},"page":"439-454","source":"Crossref","is-referenced-by-count":1,"title":["Long-Lived Tasks"],"prefix":"10.1007","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351. ACM Press (1993)","key":"32_CR1","DOI":"10.1145\/164051.164056"},{"issue":"3","key":"32_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"32_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/S0097539798344367","volume":"34","author":"TD Chandra","year":"2004","unstructured":"Chandra, T.D., Hadzilacos, V., Jayanti, P., Toueg, S.: Generalized irreducibility of consensus and the equivalence of $$t$$ -resilient and wait-free implementations of consensus. SIAM J. Comput. 34(2), 333\u2013357 (2004)","journal-title":"SIAM J. Comput."},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-662-48653-5_28","volume-title":"Distributed Computing","author":"A Casta\u00f1eda","year":"2015","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Specifying concurrent problems: beyond linearizability and up to tasks. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 420\u2013435. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48653-5_28"},{"issue":"4","key":"32_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0020-0190(02)00498-2","volume":"86","author":"R Friedman","year":"2003","unstructured":"Friedman, R., Vitenberg, R., Chokler, G.: On the composability of consistency conditions. Inf. Process. Lett. 86(4), 169\u2013176 (2003)","journal-title":"Inf. Process. Lett."},{"unstructured":"Gafni, E.: Snapshot for time: the one-shot case, 10 pages (2014). arXiv:1408.3432v1","key":"32_CR6"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology, 336 pages. Morgan Kaufmann\/Elsevier (2014)","key":"32_CR7","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2013.03.002","volume":"509","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M.: Power and limits of distributed computing shared memory models. Theoret. Comput. Sci. 509, 3\u201324 (2013)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Hemed, N., Rinetzky, N.: Brief announcement: concurrency-aware linearizability. In: Proceedings of the 33th ACM Symposium on Principles of Distributed Computing (PODC 2014), pp. 209\u2013211. ACM Press (2014)","key":"32_CR9","DOI":"10.1145\/2611462.2611513"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-662-48653-5_25","volume-title":"Distributed Computing","author":"N Hemed","year":"2015","unstructured":"Hemed, N., Rinetzky, N., Vafeiadis, V.: Modular verification of concurrency-aware linearizability. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 371\u2013387. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48653-5_25"},{"issue":"3","key":"32_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"32_CR12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S Moran","year":"1987","unstructured":"Moran, S., Wolfstahl, Y.: Extended impossibility results for asynchronous complete networks. Inf. Process. Lett. 26(3), 145\u2013151 (1987)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Neiger, G.: Set-linearizability. Brief announcement in Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC 1994), p. 396. ACM Press (1994)","key":"32_CR13","DOI":"10.1145\/197917.198176"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:58:28Z","timestamp":1569340708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}