lvc@cbnews.ATT.COM (Lawrence V. Cipriani) (05/17/89)
A friend of mine is interested in the mathematics of parallel processing. If you know of any references [texts, or papers] please send email to me about the reference. I will provide a summary to comp.parallel on 05/30/89. Thanks for your help. -- Larry Cipriani, att!cbnews!lvc or lvc@cbnews.att.com "Life is not a seminar." -- Thomas Sowell
lvc@cbnews.ATT.COM (Lawrence V. Cipriani) (06/02/89)
As promised [but late - sorry] here are the list of references I received on the mathematics of parallel processing. I Thank Roger Shepherd, David Rich, Hubert Matthews, S. Manoharan, Conor O'Neill, Mike Mc Gaughey, Thomas Mookken, and Ian Parberry for sending me references. And here they are, pretty much in free form as I received them. Hope others find this useful too. -------------------------------------------------------------------------------- Communicating Sequential Processes, C. A. R. Hoare, CACM Vol. 21 8 (Aug 78), p666 - Hoare's original CSP paper; not very mathematical. -------------------------------------------------------------------------------- Communicating Sequential Processes, C. A. R. Hoare, Prentice-Hall, 1985. ISBN 0-13-153289-8 in paperback. This describes the mathematical foundation for languages like occam. It's very well written and readable and is an "important" work for anyone concerned with the mathematics of programming. -------------------------------------------------------------------------------- Denotational Semantics for occam, AW Roscoe, Presented at NSF/SERC Seminar on concurency, CMU, July 1984. - My reference to this says `to be published' but this is rather old. occam is a distributed programming language which was developed at Inmos; it has a formal semantics (mainly due to Roscoe). -------------------------------------------------------------------------------- The Laws of occam programming, AW Roscoe and CAR Hoare, Programming Research Group, Oxford University 1986 - this and many other of the PRG's monographs should be of interest -------------------------------------------------------------------------------- Algebraic Reasoning About Communication, Michael Main [David Rich gave me an email address to Main that I will use for more info] -------------------------------------------------------------------------------- David Walker, "Introduction to Calculus of Communicating Systems" ECS-LFCS-87-22, Edinburgh Univ Tech Rep. -------------------------------------------------------------------------------- %A R. Milner %T A Calculus of Communicating Systems %I Springer Verlag %S LNCS %V 92 %D 1980 %K CCS parallel process communication theory equivalence congruence %O (LA has) -------------------------------------------------------------------------------- %A R. Milner %T A complete axiomatisation of observational congruence if finite-state behaviours %R ECS-LFCS-86-8 %I Laboratory for Foundations of Computer Science, Edinburgh University %M Aug %D 1986 %K CCS, axiom, theory, finite state, process -------------------------------------------------------------------------------- %A M. Hennessy %A R. Milner %T Algebraic laws for nondeterminism and concurrency %J JACM %V 23 %N 1 %P 137-161 %M Jan %D 1985 %K communication CSP CCS theory equivalence congruence -------------------------------------------------------------------------------- %A R. Milner %T Lectures on a calculus for communicating systems %B Seminar on Concurrency %I Springer Verlag %S LNCS %V 197 %P 197-220 %D 1985 %K CCS communicating communication sequential process processes parallel concurrent message -------------------------------------------------------------------------------- %A R. Milner %T A modal characterisation of observable machine behaviour %B Trees and Algebra in Programming; 6th CAAP %I Springer Verlag %S LNCS %V 112 %M Mar %D 1981 %E E. Astesiano %E C. Bohm %P 25-34 %K CCS, observation equivalence, modal logic %X properties of machines that can be ascertained from a finite experiment. seeking machine equivalence. particularly interested in divergence. -------------------------------------------------------------------------------- for mathematics of architectures of multisatge interconnection networks, look up the ieee tutorial on interconnection networks by t-y feng and c-l wu. lots of parallel architectures described in that. -------------------------------------------------------------------------------- If computational complexity theory fits the bill, I have a book "Parallel complexity theory" published by Wiley in the Research Notes in Theoretical Computer Science series. -------------------------------------------------------------------------------- For papers, go to the ACM Symposium on Theory of Computing and IEEE Symposium on the Foundations of Computing proceedings for the last decade. -------------------------------------------------------------------------------- What does C. A. R. mean in C. A. R. Hoare? -- Larry Cipriani, att!cbnews!lvc or lvc@cbnews.att.com
art@buengc.BU.EDU (A. R. Thompson) (06/05/89)
[ Several folks responded. Since they all agree, I'm posting one.] In article <5670@hubcap.clemson.edu> lvc@cbnews.ATT.COM (Lawrence V. Cipriani) writes: > >What does C. A. R. mean in C. A. R. Hoare? Charles Anthony Richard