{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:36:29Z","timestamp":1763415389103},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,14]],"date-time":"2016-07-14T00:00:00Z","timestamp":1468454400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s00224-016-9699-8","type":"journal-article","created":{"date-parts":[[2016,7,14]],"date-time":"2016-07-14T10:27:56Z","timestamp":1468492076000},"page":"677-694","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Atomic Read\/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems"],"prefix":"10.1007","volume":"60","author":[{"given":"Achour","family":"Most\u00e9faoui","sequence":"first","affiliation":[]},{"given":"Matoula","family":"Petrolia","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Jard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,14]]},"reference":[{"key":"9699_CR1","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A.: Bounded wait-free implementation of optimally resilient Byzantine storage without (unproven) cryptographic assumptions. In: Proceedings 21st Int?l Symposium on Distributed Computing (DISC?07), pp 7\u201319. Springer LNCS 4731 (2007)","DOI":"10.1145\/1281100.1281147"},{"issue":"1","key":"9699_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jagm.1999.1025","volume":"34","author":"H Attiya","year":"2000","unstructured":"Attiya, H.: Efficient and robust sharing of memory in message-passing systems. J. Algorithm. 34(1), 109\u2013127 (2000)","journal-title":"J. Algorithm."},{"issue":"1","key":"9699_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(1), 121\u2013132 (1995)","journal-title":"J. ACM"},{"issue":"4","key":"9699_CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1142\/S0129626406002745","volume":"16","author":"H Attiya","year":"2006","unstructured":"Attiya, H., Bar-Or, A.: Sharing memory with semi-Byzantine clients and faulty storage servers. Parallel Process. Lett. 16(4), 419\u2013428 (2006)","journal-title":"Parallel Process. Lett."},{"key":"9699_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Distributed computing: fundamentals, simulations and advanced topics, 2nd edn., p 414. Wiley-Interscience (2004). (ISBN 0-471-45324-2)","DOI":"10.1002\/0471478210"},{"issue":"2","key":"9699_CR6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75 (2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"issue":"3","key":"9699_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s002360000040","volume":"37","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Kosa, M.J., Welch, J.L.: One-write algorithms for multivalued regular and atomic registers. Acta Inf. 37(3), 161\u2013192 (2000)","journal-title":"Acta Inf."},{"issue":"1","key":"9699_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00446-005-0123-x","volume":"18","author":"G Chockler","year":"2005","unstructured":"Chockler, G., Malkhi, D.: Active disk Paxos with infinitely many processes. Distrib. Comput. 18(1), 73\u201384 (2005)","journal-title":"Distrib. Comput."},{"key":"9699_CR9","doi-asserted-by":"crossref","unstructured":"Dobre, D., Guerraoui, R., Majuntke, M., Suri, N., Vukolic, M.: The complexity of robust atomic storage. In: Proceedings 30th ACM Symposium on Principles of Distributed Computing (PODC?11), pp 59\u201368. ACM Press (2011)","DOI":"10.1145\/1993806.1993816"},{"key":"9699_CR10","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Vukolic, M.: How fast can a very robust read be?. In: Proceedings 25th ACM Symposium on Principles of Distributed Computing (PODC\u201906), pp 248\u2013257. ACM Press (2006)","DOI":"10.1145\/1146381.1146419"},{"issue":"3","key":"9699_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Programm. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"9699_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2016.03.012","volume":"93-94","author":"D Imbs","year":"2016","unstructured":"Imbs, D., Rajsbaum, S., Raynal, M., Stainer, J.: Read\/write shared memory abstraction on top of asynchronous byzantine message-passing systems. J. Parallel Distrib. Comput. 93-94, 1\u20139 (2016)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"9699_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"A Ittai","year":"2006","unstructured":"Ittai, A., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk Paxos: optimal resilience with byzantine shared memory. Distrib. Comput. 18(5), 387\u2013408 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"9699_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, Part I: basic forMalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"9699_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, Part II: algorithms. Distrib. Comput. 1(2), 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"issue":"3","key":"9699_CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostack, R., Pease, M.: The Byzantine generals problem. ACM Trans. Programm. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"9699_CR17","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Reiter, M.: Secure and scalable replication in Phalanx. In: Proceedings 17th IEEE Symposium on Reliable Distributed Systems (SRDS\u201998), pp 51\u201358. IEEE Press (1998)","DOI":"10.1109\/RELDIS.1998.740474"},{"key":"9699_CR18","doi-asserted-by":"crossref","unstructured":"Martin, J.-P.H., Alvisi, L.: A framework for dynamic Byzantine storage. In: Proceedings International Conference on Dependable Systems and Networks (DSN\u201904), pp 325\u2013334. IEEE Press (2004)","DOI":"10.1109\/DSN.2004.1311902"},{"issue":"1","key":"9699_CR19","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/5001.5007","volume":"8","author":"J Misra","year":"1986","unstructured":"Misra, J.: Axioms for memory access in asynchronous hardware systems. ACM Trans. Programm. Lang. Syst. 8(1), 142\u2013153 (1986)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"4","key":"9699_CR20","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1109\/TPDS.2015.2427797","volume":"27","author":"A Most\u00e9faoui","year":"2016","unstructured":"Most\u00e9faoui, A., Raynal, M.: Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine processes. IEEE Trans. Parallel Distrib. Syst. 27(4), 1085\u20131097 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9699_CR21","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R.R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"9699_CR22","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Communication and agreement abstractions for fault-tolerant asynchronous distributed systems, p 251. Morgan & Claypool Publishers (2010). (ISBN 978-1-60845-293-4)","DOI":"10.1007\/978-3-031-02000-1"},{"key":"9699_CR23","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Concurrent programming: algorithms, principles and foundations, p 515. Springer (2013). (ISBN 978-3-642-32026-2)","DOI":"10.1007\/978-3-642-32027-9"},{"key":"9699_CR24","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Distributed algorithms for message-passing systems, p 510. Springer (2013). (ISBN: 978-3-642-38122-5)","DOI":"10.1007\/978-3-642-38123-2"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9699-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9699-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9699-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9699-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T02:32:36Z","timestamp":1656815556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9699-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,14]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9699"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9699-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,14]]}}}