Summary: [18] K. Gharachorloo. electronic mail message, January 11 1994.
[19] P. Gibbons and M. Merritt. Specifying Non­Blocking Shared Memories. In Proc. 4th ACM
Symp. on Parallel Algorithms and Architectures, pages 306--315, July 1992.
[20] P. Gibbons, M. Merritt, and K. Gharachorloo. Proving Sequential Consistency of High­
Performance Shared Memories. In Proc. of the 3rd ACM Symposium on Parallel Algo­
rithms and Architectures, pages 292--303, July 1991.
[21] M. Herlihy and J. Wing. Linearizability: A Correctness Condition for Concurrent Objects.
ACM Trans. on Programming Languages and Systems, 12(3):463--492, 1990.
[22] L. Lamport. A New Solution of Dijkstra's Concurrent Programming Problem. Commu­
nications of the ACM, 17(8):453--455, August 1974.
[23] L. Lamport. Time, Clocks and the Ordering of Event in a Distributed System. Commu­
nications of the ACM, 21(7):558--565, 1978.
[24] J. Mellor­Crummey. On­the­fly Detection of Data Races for Programs with Nested Fork­
Join Parallelism. Supercomputing, pages 24--33, November 1991.
[25] B. Neidecker­Lutz. electronic mail message, 1993.
[26] R. Netzer and B. Miller. Improving the Accuracy of Data Race Detection. In Proc. of the
3rd ACM Symposium on Principles and Practice of Parallel Programming, pages 133--144,
April 1991.
[27] R. Netzer and B. Miller. What are Race Conditions? Some Issues and Formalizations.
ACM Letters on Programming Languages and Systems, 1(1), March 1992.

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences