The concurrent assignment representation of synchronous systems

Abstract We consider the specification and programming of synchronous concurrent algorithms. This general class of algorithms includes clocked hardware, systolic algorithms, neural nets for example. We present some simple theory, pratical formal methods, and software tools to help design these algorithms.

[1]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[2]  Lawrence Snyder.  Hearts: A Dialect of the Poker Programming Environment Specialized to Systolic Computation. , 1986 .

[3]  Peter H. Welch.  Parallel assignment revisited , 1983, Softw. Pract. Exp..

[4]  Patrice Quinton,et al.  The systematic design of systolic arrays , 1987 .

[5]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[6]  J. V. Tucker,et al.  Specification, Derivation and Verification of Concurrent Line Drawing Algorithms and Architectures , 1988 .

[7]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[8]  J. V. Tucker,et al.  Program correctness over abstract data types, with error-state semantics , 1988, CWI monographs.

[9]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[10]  Stephen N. Zilles,et al.  Specification techniques for data abstractions , 1975 .

[11]  J. V. Tucker,et al.  Theoretical Considerations in Algorithm Design , 1985 .

[12]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[13]  Yves Robert,et al.  Automata networks in computer science : theory and applications , 1987 .

[14]  Guy-René Perrin,et al.  Synthesis of Systolic arrays for Inductive Problems , 1987, PARLE.

[15]  C. Pandu Rangan,et al.  A Simple Implementation of Warshall's Algorithm on a VLSI Chip , 1986, WG.

[16]  Amos Fiat,et al.  Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers , 1984, J. Comput. Syst. Sci..

[17]  David Gries,et al.  The Multiple Assignment Statement , 1978, IEEE Transactions on Software Engineering.

[18]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[19]  K. Mani Chandy,et al.  An example of stepwise refinement of distributed programs: quiescence detection , 1986, TOPL.

[20]  D. W. Barron,et al.  The Main Features of CPL , 1963, Comput. J..

[21]  Frances L. Van Scoy.  The Parallel Recognition of Classes of Graphs , 1980, IEEE Trans. Computers.

[22]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[23]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[24]  J. V. Tucker,et al.  The Concurrent Assignment Representation of Synchronous Systems , 1987, PARLE.

[25]  Carlo H. Séquin,et al.  Doubly twisted torus networks for VLSI processor arrays , 1981, ISCA '81.

[26]  Alain J. Martin.  The Torus: An Exercise in Constructing a Processing Surface , 1982 .

[27]  L. Snyder,et al.  Parallel Programming and the Poker Programming Environment , 1984, Computer.

[28]  Gregory R. Andrews,et al.  The distributed programming language SR—Mechanisms, design and implementation , 1982, Softw. Pract. Exp..

[29]  Marina C. Chen.  A parallel language and its compilation to multiprocessor machines or VLSI , 1986, POPL '86.