{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:15Z","timestamp":1725455595939},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552369"},{"type":"electronic","value":"9783540467892"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0022437","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"52-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pseudo read-modify-write operations: Bounded wait-free implementations"],"prefix":"10.1007","author":[{"given":"James H.","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Bojan","family":"Gro\u0161elj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"issue":"No.2","key":"4_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1990","unstructured":"M. Abadi and L. Lamport, \u201cThe Existence of Refinement Mappings,\u201d Theoretical Computer Science, Vol. 82, No. 2, May 1990, pp. 253\u2013284.","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, \u201cAtomic Snapshots of Shared Memory,\u201d Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, 1990, pp. 1\u201314.","DOI":"10.21236\/ADA222765"},{"key":"4_CR3","volume-title":"Technical Report TR.89.26","author":"J. Anderson","year":"1989","unstructured":"J. Anderson, \u201cMultiple-Writer Composite Registers,\u201d Technical Report TR.89.26, Department of Computer Sciences, University of Texas at Austin, September 1989."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"J. Anderson, \u201cComposite Registers,\u201d Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, 1990, pp. 15\u201330.","DOI":"10.1145\/93385.93396"},{"key":"4_CR5","volume-title":"Technical Report TR.90.23","author":"J. Anderson","year":"1990","unstructured":"J. Anderson and M. Gouda, \u201cThe Virtue of Patience: Concurrent Programming With and Without Waiting,\u201d Technical Report TR.90.23, Department of Computer Sciences, University of Texas at Austin, July 1990."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Gouda, \u201cA Criterion for Atomicity,\u201d Formal Aspects of Computing: The International Journal of Formal Methods, scheduled to appear in 1992.","DOI":"10.1007\/BF01212305"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. Herlihy, \u201cWait-Free Data Structures in the Asynchronous PRAM Model,\u201d Proceedings of the Second Annual ACM Symposium on Parallel Architectures and Algorithms, July, 1990.","DOI":"10.1145\/97444.97701"},{"key":"4_CR8","volume-title":"Report CS-R8707","author":"B. Awerbuch","year":"1987","unstructured":"B. Awerbuch, L. Kirousis, E. Kranakis, P. Vitanyi, \u201cOn Proving Register Atomicity,\u201d Report CS-R8707, Centre for Mathematics and Computer Science, Amsterdam, 1987."},{"issue":"No.12","key":"4_CR9","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1109\/12.9729","volume":"37","author":"B. Bloom","year":"1988","unstructured":"B. Bloom, \u201cConstructing Two-Writer Atomic Registers,\u201d IEEE Transactions on Computers, Vol. 37, No. 12, December 1988, pp. 1506\u20131514. Also appeared in Proceedings of the Sixth Annual Symposium on Principles of Distributed Computing, 1987, pp. 249\u2013259.","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J. Burns and G. Peterson, \u201cConstructing Multi-Reader Atomic Values from Non-Atomic Values,\u201d Proceedings of the Sixth Annual Symposium on Principles of Distributed Computing, 1987, pp. 222\u2013231.","DOI":"10.1145\/41840.41859"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"K. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF00571463","volume":"2","author":"M. Clint","year":"1973","unstructured":"M. Clint, \u201cProgram Proving: Coroutines,\u201d Acta Informatica, Vol. 2, p. 50\u201363, 1973.","journal-title":"Acta Informatica"},{"issue":"No.10","key":"4_CR13","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"P. Courtois","year":"1971","unstructured":"P. Courtois, F. Heymans, and D. Parnas, \u201cConcurrent Control with Readers and Writers,\u201d Communications of the ACM, Vol. 14, No. 10, October 1971, pp. 667\u2013668.","journal-title":"Communications of the ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"M. Herlihy, \u201cImpossibility and Universality Results for Wait-Free Synchronization,\u201d Proceedings of the Seventh Annual Symposium on Principles of Distributed Computing, 1988, pp. 276\u2013290.","DOI":"10.1145\/62546.62593"},{"issue":"No.3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"M. Herlihy and J. Wing, \u201cLinearizability: A Correctness Condition for Concurrent Objects,\u201d ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3, 1990, pp. 463\u2013492.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li, \u201cBounded time-stamps,\u201d Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 371\u2013382.","DOI":"10.1109\/SFCS.1987.10"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0019809","volume":"312","author":"L. Kirousis","year":"1987","unstructured":"L. Kirousis, E. Kranakis, and P. Vitanyi, \u201cAtomic Multireader Register,\u201d Proceedings of the Second International Workshop on Distributed Computing, Springer Verlag Lecture Notes in Computer Science 312, 1987, pp. 278\u2013296.","journal-title":"Springer Verlag Lecture Notes in Computer Science"},{"issue":"No.4","key":"4_CR18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1145\/48022.48024","volume":"10","author":"C. Kruskal","year":"1988","unstructured":"C. Kruskal, L. Rudolph, M. Snir, \u201cEfficient Synchronization on Multiprocessors with Shared Memory,\u201d ACM Transactions on Programming Languages and Systems, Vol. 10, No. 4, October 1988, pp. 579\u2013601.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR19","volume-title":"Technical Report CS-TR-2082.3","author":"S. Lam","year":"1988","unstructured":"S. Lam and A. Shankar, \u201cSpecifying Modules to Satisfy Interfaces: A State Transition System Approach,\u201d Technical Report CS-TR-2082.3, University of Maryland at College Park, 1988."},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, \u201cOn Interprocess Communication, Parts I and II,\u201d Distributed Computing, Vol. 1, pp. 77\u2013101, 1986.","journal-title":"Distributed Computing"},{"key":"4_CR21","volume-title":"How to Construct Wait-Free Variables","author":"M. Li","year":"1989","unstructured":"M. Li, J. Tromp, and P. Vitanyi, \u201cHow to Construct Wait-Free Variables,\u201d unpublished manuscript, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1989."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"R. Newman-Wolfe, \u201cA Protocol for Wait-Free, Atomic, Multi-Reader Shared Variables, Proceedings of ike Sixth Annual Symposium on Principles of Distributed Computing, 1987, pp. 232\u2013248.","DOI":"10.1145\/41840.41860"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries, \u201cAn Axiomatic Proof Technique for Parallel Programs I,\u201d Acta Informatica, Vol. 6, pp. 319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"G. Peterson","year":"1983","unstructured":"G. Peterson, \u201cConcurrent Reading While Writing,\u201d ACM Transactions on Programming Languages and Systems, Vol. 5, 1983, pp. 46\u201355.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"G. Peterson and J. Burns, \u201cConcurrent Reading While Writing II: The Multi-Writer Case,\u201d Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987.","DOI":"10.1109\/SFCS.1987.15"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"A. Singh, J. Anderson, and M. Gouda, \u201cThe Elusive Atomic Register, Revisited,\u201d Proceedings of the Sixth Annual Symposium on Principles of Distributed Computing, 1987, pp. 206\u2013221.","DOI":"10.1145\/41840.41858"},{"key":"4_CR27","volume-title":"How to Construct an Atomic Variable","author":"J. Tromp","year":"1989","unstructured":"J. Tromp, \u201cHow to Construct an Atomic Variable,\u201d unpublished manuscript, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1989."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"P. Vitanyi and B. Awerbuch, \u201cAtomic Shared Register Access by Asynchronous Hardware,\u201d Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, 1986, pp. 233\u2013243.","DOI":"10.1109\/SFCS.1986.11"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:34:26Z","timestamp":1578544466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022437"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552369","9783540467892"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0022437","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}