# Parallelism and programming: A perspective

Invited Talk

First Online:

## Keywords

Control Flow Parallel Program Proof System Assignment Statement Systolic Array## Preview

Unable to display preview. Download preview PDF.

## Bibliography

- Aho, A. V., J. E. Hopcroft, and J. D. Ullman [1983].
*Data Structures and Algorithms*, Reading, Massachusetts: Addison-Wesley, 1983.Google Scholar - Andrews, G. R., and F. B. Schneider [1983]. “Concepts and Notations for Concurrent Programming,”
*Computing Surveys*,**15**:1, March 1983, pp. 3–43.CrossRefGoogle Scholar - Backus, J. [1978]. “Can Programming be Liberated from the von Neumaan Style? A Functional Style and its Algebra of Programs,”
*C.ACM*,**21**:8, August 1978, pp. 613–641.CrossRefGoogle Scholar - Bertsekas, D. P. [1982]. “Distributed Dynamic Programming,”
*IEEE Transactions on Automatic Control*,**AC-27**:3, June 1982, pp. 610–616.CrossRefGoogle Scholar - Brown, G. M. [1987]. “Self Stabilizing Distributed Resource Allocation,” Ph.D. thesis, University of Texas at Austin, Austin, Texas, 1987.Google Scholar
- Brownston, L., et al., [1985].
*Programming Expert Systems in OPS5*, Reading, Massachusetts: Addison-Wesley, 1985.Google Scholar - Chandy, K. M. [1984]. “Concurrent Programming for the Masses,” (invited address)
*3rd Annual ACM Symposium on Principles of Distributed Computing*, Vancouver, Canada, August 5–7, 1984. (The text appears in*Proc. of the 4th Annual ACM Symposium on Principles of Distributed Computing*, 1985, pp. 1–12.)Google Scholar - Chandy, K. M., and J. Misra [1986a]. “An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection,”
*ACM TOPLAS*,**8**:3, July 1986, pp. 326–343.CrossRefGoogle Scholar - Chandy, K. M., and J. Misra [1986b]. “Systolic Algorithms as Programs,”
*Distributed Computing*,**1**, 1986, pp. 177–183.CrossRefGoogle Scholar - Cook, S. A. [1983]. “The Classification of Problems Which Have Fast Parallel Algorithms,”
*Proc. of 24th IEEE Symposium on the Foundations of Computer Science*, 1983.Google Scholar - Dijkstra, E. W. [1976].
*A Discipline of Programming*, Englewood Cliffs, New Jersey: Prentice-Hall, 1976.Google Scholar - Dijkstra, E. W. [1968]. “Cooperating Sequential Processes,” (in)
*Programming Languages*, (ed.) Genuys, New York: Academic Press, 1968, pp. 43–112.Google Scholar - Francez, N. [1986].
*Fairness*, New York: Springer-Verlag, 1986.Google Scholar - Goldschlager, L. M. [1978]. “Synchronous Parallel Computation,” Ph.D. thesis, University of Toronto, Toronto, Ontario, (1977); see also
*Proc. of 10th ACM Symposium on the Theory of Computing*, 1978, pp. 89–94 and*J.ACM*,**29**:4, October 1982, pp. 1073–1086.Google Scholar - Hoare, C. A. R. [1984].
*Communicating Sequential Processes*, London: Prentice-Hall International, 1984.Google Scholar - Hoare, C. A. R. [1978]. “Communicating Sequential Processes,”
*C.ACM*,**21**:8, August 1978, pp. 666–677.CrossRefGoogle Scholar - Lamport, L., and F. B. Schneider [1984]. “The ‘Hoare Logic’ of CSP, and All That,”
*ACM TOPLAS*,**6**:2, April 1984, pp. 281–296.CrossRefGoogle Scholar - Lynch, N. A., and M. R. Tuttle [1987]. “Hierarchical Correctness Proofs for Distributed Algorithms,”
*Proc. of 6th Annual ACM Symposium on Principles of Distributed Computing*, Vancouver, Canada, 1987.Google Scholar - Manna, Z., and A. Pnueli [1983]. “How to Cook a Temporal Proof System for Your Pet Language,”
*Proc. of the 10th Annual ACM Symposium on Principles of Programming Languages*, Austin, Texas, 1983.Google Scholar - Milner, R. [1983]. “Calculi for Synchrony and Asynchrony,”
*Theoretical Computer Science*,**25**, 1983, pp. 267–310.CrossRefGoogle Scholar - Parker, R. A., et al., [1980]. “Abstract Interface Specifications for the A-7E Device Interface Module,”
*U.S. Navy Research Laboratories Memorandum Report 4385*, November 1980.Google Scholar - Pippenger, N. [1979]. “On Simultaneous Resource Bounds,”
*Proc. of 20th IEEE Symposium on Foundations of Computer Science*, 1979, pp. 307–311.Google Scholar - Pnueli, Amir [1981]. “The Temporal Semantics of Concurrent Programs,”
*Theoretical Computer Science*,**13**, 1981, pp. 45–60.CrossRefGoogle Scholar - van de Snepscheut, J. L. A., and J. B. Swenker [1987]. “On the Design of Some Systolic Algorithms,”
*JAN 131a*, The Netherlands: University of Groningen, 1987.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1987