Testing and Verifying Concurrent Objects

Journal of Parallel and Distributed Computing

Volumn 17, Issue 1-2, 1993, Pages 164-182

  Wing, Jennette M ^a   Gong, Chun ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000077087     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1993.1015     Document Type: Article

References (25)

1. Brookes, S. D. An axiomatic treatment of a parallel language. In Proceedings of Conference on Logics of Programs. Brooklyn, NY, 1985. Springer Lecture Notes in Computer Science, Vol. 193, Springer-Verlag, Berlin/New York, 1985.
2. Brookes, S. D. A semantically-based proof system for partial correctness and deadlock in CSP. In Proceedings of Symposium on Logic in Computer Science. Cambridge, MA, 1986. IEEE Computer Society Press, New York, 1986.
3. Burns, J. E., and Peterson, G. L. Constructing multi-reader atomic values from non-atomic values. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing. 1987, pp. 222-231.
4. Chor, B., Israeli, A., and Li, M. On processor coordination using asynchronous hardware. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987, pp. 86-97.
5. Cooper, Eric C. C threads. Technical Report CMU-CS-88-154. School of Computer Science, Carnegie Mellon University, 1988.
6. Dijkstra, E. W. Notes on Structured Programming. Academic Press, New York. 1972, pp. 1-82.
7. Ellis, C. S. Concurrent search and insertion in 2-3 trees. Acta Inform. 14 (1980).
8. Gottlieb, A., Lubachevsky, B. D. and Rudolph, L. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Programming Lang. Systems 5, 2 (Apr. 1983). 164-189.
9. Schneider, F. B., and Andrews, G. R. Concepts and notations for concurrent programming. Compitt. Surveys 15, 1 (Mar. 1983), 1-43.
10. Guttag, J. V., and Horning, J. J. Introduction to LCL. a Larch/C interface language. Technical Report 74, DEC/Systems Research Center, Aug. 1991.
11. Guttag, J. V., Horning, J. J., and Wing, J. M. The Larch family of specification languages. IEEE Software 2, 5 (Sept. 1985), 24-36.
12. Herlihy, M. P. Impossibility and universality results for wait-free synchronization. In Seventh ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC). Aug. 1988.
13. Herlihy, M. A methodology for implementing highly concurrent data structures. In Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Mar. 1990. pp. 197-206.
14. Herlihy, M. P., and Wing, J. M. Implementing queues without mutual exclusion. Some queue examples.
15. Herlihy, M. P., and Wing, J. M. Axioms for concurrent objects. In Fourteenth ACM Symposium on Principles of Programming Languages. Jan. 1987, pp. 13-26.
16. Herlihy, M. P., and Wing, J. M. Linearizability: A correctness condition for concurrent objects. ACM Trans. Programming Lang. Systems 12, 3 (July 1990), 463-492.
17. Herlihy, M. P., and Wing, J. M. Specifying graceful degradation. IEEE Trans. Parallel Distrib. Coinput. (Jan. 1991), 93-104.
18. Lamport, L. Concurrent reading and writing. Comm. ACM 20, 11 (Nov. 1977), 806-811.
19. Lamport, L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28, 9 (Sept 1979), 690.
20. Lanin, V., and Shasha, D. Concurrent set manipulation without locking. In Proceedings of the Seventh ACM Symposium on Principles of Database Systems. Mar. 1988, pp. 211-220.
21. Lehman, P. L., and Bing Yao, S. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Systems 6, 4 (1981). 650-670.
22. Mellor-Crummey, J. M. Concurrent queues: Practical fetch-and-4 algorithms. Technical Report TR 229, Dept, of Computer Science, University of Rochester, Nov. 1987.
23. Misra, J. Axioms for memory access in asynchronous hardware systems. ACM Trans. Programming Lang. Systems 8, 1 (Jan. 1986). 142-153.
24. Papadimitriou, C. H. The serializability of concurrent database updates. J. Assoc. Comput. Math. 26, 4 (Oct. 1979), 631-653.
25. Weihl, W. E., and Wang, P. Multi-version memory: Software cache management for concurrent B-lrees. In Proceedings of the 1990 IEEE Symposium on Parallel and Distributed Computing. Dallas. TX, Dec. 1990, pp. 650-655.