A Foundation of Parallel Programming
This monograph introduces a programming theory (called UNITY) that is applicable to the design of parallel (concurrent/distributed/multi-process) programs. This theory consists of a simple computational model and a logic that is appropriate for specifying and reasoning about such programs. The computational model was first proposed in Chandy ; a full account of this work appears in Chandy and Misra . This manuscript contains an abbreviated version of the theory and a few small examples to illustrate the theory.
KeywordsUnion Theorem Programming Theory Induction Rule Statement Execution General Conjunction
Unable to display preview. Download preview PDF.
- 1.K. Mani Chandy, “Concurrent Programming for the Masses,” Invited Lecture at The Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B.C., Canada, August 27–29, 1984, published in the Proceedings of he Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, pp. 1–12, August 5–7, 1985.Google Scholar
- 2.K. Mani Chandy and Jayadev Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.Google Scholar
- 3.K. Mani Chandy and Jayadev Misra, “On Proofs of Distributed Algorithms, with Application to the Problem of Termination Detection,” working material, International Summer School on Constructive Methods in Computing Science, Marktoberdorf, Germany, July 24-August 5, 1988.Google Scholar
- 4.Jayadev Misra, “General Conjunction and Disjunction of unless,” Notes on UNITY 01–88, The University of Texas at Austin, 1988.Google Scholar
- 5.Jayadev Misra, “A Theorem about Dynamic Acyclic Graphs,” Notes on UNITY 02–88, The University of Texas at Austin, 1988.Google Scholar
- 6.Jayadev Misra, “A Specification of a Buffer,” unpublished manuscript, The University of Texas at Austin, July 1988.Google Scholar