{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:10:02Z","timestamp":1736028602446,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_13","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"152-168","source":"Crossref","is-referenced-by-count":6,"title":["Proving Atomicity: An Assertional Approach"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Chockler","sequence":"first","affiliation":[]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"Sayan","family":"Mitra","sequence":"additional","affiliation":[]},{"given":"Joshua","family":"Tauber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: Optimal resilience with byzantine shared memory. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), St John\u2019s Newfoundland, Canada, July 2004, pp. 226\u2013235 (2004)","DOI":"10.1145\/1011767.1011801"},{"key":"13_CR2","unstructured":"Archer, M.: TAME: PVS Strategies for special purpose theorem proving. Annals of Mathematics and Artificial Intelligence\u00a029(1\/4) (February 2001)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"124","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. Journal of the ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"Journal of the ACM"},{"key":"13_CR4","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill Publishing Company, UK (1998)"},{"key":"13_CR5","unstructured":"Bogdanov, A.: Formal verification of simulations between i\/o automata. Master\u2019s thesis, Massachusetts Institute of Technology (July 2001)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chockler, G., Lynch, N., Mitra, S., Tauber, J.: Proving atomicity: An assertional approach. Technical Report MIT\/LCS\/TR-XXX, MIT Laboratory for Computer Science (2005)","DOI":"10.21236\/ADA466773"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-30232-2_7","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"S. Doherty","year":"2004","unstructured":"Doherty, S., Groves, L., Luchangco, V., Moir, M.: Formal verification of a practical lock-free queue algorithm. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 97\u2013114. Springer, Heidelberg (2004)"},{"key":"13_CR8","unstructured":"Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.L.: GeoQuorums: Implementing atomic memory in ad hoc networks"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fekete, A., Gupta, D., Luchangco, V., Lynch, N., Shvartsman, A.: Eventually-serializable data services. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, PA, May 1996, pp. 300\u2013309 (1996)","DOI":"10.1145\/248052.248113"},{"issue":"3","key":"13_CR10","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(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR11","unstructured":"Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: The theory of timed I\/O automata. Technical Report MIT\/LCS\/TR-917a, MIT Laboratory for Computer Science (2004), Available at http:\/\/theory.lcs.mit.edu\/tds\/reflist.html"},{"key":"13_CR12","unstructured":"Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: Timed I\/O automata: A mathematical framework for modeling and analyzing real-time system. In: RTSS 2003: The 24th IEEE International Real-Time Systems Symposium, Cancun, Mexico, December 2003,"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/138873.138877","volume":"10","author":"R. Ladin","year":"1992","unstructured":"Ladin, R., Liskov, B., Shrira, L., Ghemawat, S.: Providing high availability using lazy replication. ACM Transactions on Computer Science\u00a010(4), 360\u2013391 (1992)","journal-title":"ACM Transactions on Computer Science"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems\u00a016(2), 133\u2013169 (1998); Earlier version in Research Report 49, Digital Equipment Corporation Systems Research Center, Palo Alto, CA (September 1989)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"7","key":"13_CR15","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. Communications of the ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication: Part I and II. Dist. Comput.\u00a01, 77\u2013101 (1986)","journal-title":"Dist. Comput."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, Part II: Algorithms. Distributed Computing\u00a01(2), 86\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"4","key":"13_CR18","first-page":"18","volume":"32","author":"L. Lamport","year":"2001","unstructured":"Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column)\u00a032(4), 18\u201325 (2001)","journal-title":"ACM SIGACT News (Distributed Computing Column)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Lampson, B.: The ABCD\u2019s of paxos. In: Proceedings of the Twentieth Annual ACM symposium on Principles of Distributed Computing, Newport, RI (August 2001)","DOI":"10.1145\/383962.383969"},{"issue":"3","key":"13_CR20","first-page":"219","volume":"2","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to Input\/Output Automata. CWI Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"key":"13_CR21","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo (1996)"},{"key":"13_CR22","first-page":"272","volume-title":"Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS 1997)","author":"N. Lynch","year":"1997","unstructured":"Lynch, N., Shvartsman, A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS 1997), Seattle, Washington, USA, June 1997, pp. 272\u2013281. IEEE, Los Alamitos (1997)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-36108-1_12","volume-title":"Distributed Computing","author":"N. Lynch","year":"2002","unstructured":"Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 173\u2013190. Springer, Heidelberg (2002) Also, Technical Report MIT-LCS-TR-856"},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Journal of Distributed Computing\u00a011(4), 203\u2013213 (1998)","journal-title":"Journal of Distributed Computing"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-36108-1_21","volume-title":"Distributed Computing","author":"J.P. Martin","year":"2002","unstructured":"Martin, J.P., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 311\u2013325. Springer, Heidelberg (2002)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-61474-5_91","volume-title":"Computer Aided Verification","author":"S. Owre","year":"1996","unstructured":"Owre, S., Rajan, S., Rushby, J.M., Shankar, N., Srivas, M.K.: PVS: Combining specification, proof checking, and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 411\u2013414. Springer, Heidelberg (1996)"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1109\/SFCS.1987.15","volume-title":"28th Annual Symposium on Foundations of Computer Science","author":"G.L. Peterson","year":"1987","unstructured":"Peterson, G.L., Burns, J.E.: Concurrent reading while writing II: The multi-writer case. In: 28th Annual Symposium on Foundations of Computer Science, October 1987, pp. 383\u2013392. IEEE, Los Angeles (1987)"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/158439.158441","volume":"25","author":"A. Udaya Shankar","year":"1993","unstructured":"Udaya Shankar, A.: An introduction to assertional reasoning for concurrent systems. ACM Comput. Surv.\u00a025(3), 225\u2013262 (1993)","journal-title":"ACM Comput. Surv."},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-39989-6_8","volume-title":"Distributed Computing","author":"C. Shao","year":"2003","unstructured":"Shao, C., Pierce, E., Welch, J.L.: Multi-writer consistency conditions for shared memory objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 106\u2013120. Springer, Heidelberg (2003)"},{"key":"13_CR30","unstructured":"Tauber, J.A.: Verifiable Compilation of I\/O Automata without Global Synchronization. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA (September 2004)"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Tauber, J.A., Lynch, N.A., Tsai, M.J.: Compiling IOA without global synchronization. In: Proceedings of the the 3rd IEEE International Symposium on Network Computing and Applications (IEEE NCA 2004), September 2004, pp. 121\u2013130 (2004)","DOI":"10.1109\/NCA.2004.1347769"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-51687-5_51","volume-title":"Distributed Algorithms","author":"J. Tromp","year":"1989","unstructured":"Tromp, J.: How to construct an atomic variable. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 292\u2013302. Springer, Heidelberg (1989)"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01786633","volume":"4","author":"K. Vidyasankar","year":"1990","unstructured":"Vidyasankar, K.: Concurrent reading while writing revisited. Distributed Computing\u00a04, 81\u201385 (1990)","journal-title":"Distributed Computing"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-36108-1_8","volume-title":"Distributed Computing","author":"P. Vitanyi","year":"2002","unstructured":"Vitanyi, P.: Simple wait-free multireader registers. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 118\u2013132. Springer, Heidelberg (2002)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.M.B.: Distributed elections in an Archimedean ring of processors. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, April\/May 1984, pp. 542\u2013547. Washington, D.C (1984)","DOI":"10.1145\/800057.808725"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Vitanyi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: 27th IEEE Annual Symposium on Foundations of Computer Science, pp. 233\u2013243 (1986)","DOI":"10.1109\/SFCS.1986.11"},{"key":"13_CR37","volume-title":"Proc. ACM SIGPLAN 2005 Symposium on Principles and Practice of Parallel Programming (PPoPP)","author":"L. Wang","year":"2005","unstructured":"Wang, L., Stoller, S.D.: Static analysis for programs with non-blocking synchronization. In: Proc. ACM SIGPLAN 2005 Symposium on Principles and Practice of Parallel Programming (PPoPP). ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:44:01Z","timestamp":1736027041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11561927_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}