{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:03Z","timestamp":1760202663854},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_12","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"164-178","source":"Crossref","is-referenced-by-count":3,"title":["Asynchronous Resilient Linearizability"],"prefix":"10.1007","author":[{"given":"Sagar","family":"Chordia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Rajamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaushik","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ganesan","family":"Ramalingam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kapil","family":"Vaswani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/97444.97701","volume-title":"Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1990","author":"J. Aspnes","year":"1990","unstructured":"Aspnes, J., Herlihy, M.: Wait-free data structures in the asynchronous pram model. In: Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1990, pp. 340\u2013349. ACM, New York (1990)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM\u00a042 (1995)","DOI":"10.1145\/200836.200869"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M.M., Vechev, M.T.: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In: POPL, pp. 487\u2013498 (2011)","DOI":"10.1145\/1925844.1926442"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Herlihy, M., Rachman, O.: Atomic snapshots using lattice agreement. Distrib. Comput.\u00a08 (March 1995)","DOI":"10.1007\/BF02242714"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chordia, S., Rajamani, S., Rajan, K., Ramalingam, G., Vaswani, K.: Asynchronous resilient linearizability. Technical Report MSR-TR-2013-71, Microsoft Research","DOI":"10.1007\/978-3-642-41527-2_12"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/2332432.2332458","volume-title":"Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, PODC 2012","author":"J.M. Faleiro","year":"2012","unstructured":"Faleiro, J.M., Rajamani, S., Rajan, K., Ramalingam, G., Vaswani, K.: Generalized lattice agreement. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, PODC 2012, pp. 125\u2013134. ACM, New York (2012)"},{"issue":"32","key":"12_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"2","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a02(32), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012, 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/1060590.1060697","volume-title":"Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005","author":"P. Jayanti","year":"2005","unstructured":"Jayanti, P.: An optimal multi-writer snapshot algorithm. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 723\u2013732. ACM, New York (2005)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Convergent and commutative replicated data types. Bulletin of the European Association for Theoretical Computer Science (EATCS)\u00a0(104), 67\u201388 (2011)","DOI":"10.1007\/978-3-642-24550-3_29"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:40:48Z","timestamp":1558104048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}