The concurrent assignment representation of synchronous systems

  • AR Martin
  • JV Tucker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)


Data Stream Functional Language Communication Topology Synchronous System Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Andrews [1982].
    Gregory R. Andrews, “The Distributed Programming Language SR — Mechanisms, Design and Implementation,” Software — Practice and Experience, vol. 12, pp. 719–753, 1982.Google Scholar
  2. Apt [1981].
    K. R. Apt, “Ten years of Hoare logic. A survey — part 1,” ACM Trans. on Programming Languages and Systems, vol. 3, pp. 431–483, 1981.CrossRefGoogle Scholar
  3. de Bakker [1980].
    Jaco de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall International, 1980.Google Scholar
  4. Barron et al [1963].
    D. W. Barron, J. N. Buxton, D. F. Hartley, E. Nixon, and C. Strachey, “The Main Features of CPL,” The Computer Journal, vol. 6, pp. 134–143, 1963.CrossRefGoogle Scholar
  5. Blahut [1985].
    R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985.Google Scholar
  6. Chandy and Misra [1985].
    K. Mani Chandy and Jayadev Misra, Parallelism and Programming: The Proper Perspective, Computer Studies Departmental report, University of Texas at Austin, 1985.Google Scholar
  7. Chandy and Misra [1986a].
    K. Mani Chandy and J. Misra, “Systolic Algorithms as Programs”, in Distributed Computing, vol. 1, Springer-Verlag, 1986.Google Scholar
  8. Chandy and Misra [1986b].
    M. Chandy and J. Misra, “An example of stepwise refinement of distributed programs: quiescence detection,” ACM Trans. on Programming Languages and Systems, vol. 8, pp. 326–343, 1986.CrossRefGoogle Scholar
  9. Dewangan and Rangan [1983].
    Ramesh Dewangan and C. Pandu Rangan, A Simple Implementation of Warshall's Algorithm on a VLSI Chip, Dept. of Computer Science and Engineering, Indian Institute of Technology, 1983.Google Scholar
  10. Dijkstra [1976].
    Edsgar W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.Google Scholar
  11. Fiat and Shamir [1984].
    Amos Fiat and Adi Shamir, “Polymorphic Arrays: A novel VLSI layout for Systolic Computers,” in 25th FOCS, pp. 37–45, IEEE, 1984.Google Scholar
  12. Goguen et al [1978].
    J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, “An Initial Algebra approach to the Specification, Correctness and Implementation of Abstract Data Types,” in Current trends in Programming Methodology, ed. R. T. Yeh, vol. IV Data Structuring, pp. 80–149, Prentice-Hall, 1978.Google Scholar
  13. Gries [1978].
    D. Gries, “The Multiple Assignment Statement,” IEEE Transactions on Software Engineering, vol. SE-4, pp. 89–93, 1978.Google Scholar
  14. Harman and Tucker [1987].
    N. A. Harman and J. V. Tucker, The Formal Specification of a Digital Correlator I: User Specification, Centre for Theoretical Computer Science Report, The University of Leeds, 1987.Google Scholar
  15. Hoare [1985].
    C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.Google Scholar
  16. Jervis [1987].
    C. Jervis, On the Specification, Implementation and Verification of Data Types, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.Google Scholar
  17. Kung [1982].
    H. T. Kung, “Why Systolic Architectures?”, Computer, vol. 15, no. 1, pp. 37–46, 1982.Google Scholar
  18. Liskov and Zilles [1975].
    Barbara H. Liskov and Stephen N. Zilles, “Specification Techniques for Data Abstraction,” IEEE Transactions on Software Engineering, vol. SE-1, no. 1, pp. 7–12, March 1975.Google Scholar
  19. Martin [1981].
    A. J. Martin, “The Torus: An Exercise in Constructing a Processing Surface,” in Caltech Conference on VLSI, 1981.Google Scholar
  20. Mead and Conway [1980].
    C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, 1980.Google Scholar
  21. Meinke [1987].
    K. Meinke, A Mathematical Theory of Computation for Synchronous Circuits, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.Google Scholar
  22. Van Scoy [1980].
    Frances L. Van Scoy, “The Parallel Recognition of Graphs,” IEEE Trans. on Computers, vol. C-29, no. 7, pp. 363–370, July, 1980.Google Scholar
  23. Sequin [1981].
    C. H. Sequin, “Doubly Twisted Torus Networks for VLSI Processor Arrays,” in Eigth Annual Symposium on Computer Architecture, Minneapolis, Minnesota., 1981.Google Scholar
  24. Snyder [1984].
    Lawrence Snyder, “Parallel Programming and the Poker Programming Environment,” Computer, vol. 17, no. 7, pp. 27–36, July, 1984.Google Scholar
  25. Snyder [1986].
    Lawrence Snyder, “Hearts: A Dialect of the Poker Programming Environment specialized to Systolic Computation,” in Proc. of the International Workshop on Systolic Arrays at The University of Oxford, July 1986.Google Scholar
  26. Thompson [1987].
    Ben Thompson, Foundation of Compilation for VLSI Systems, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.Google Scholar
  27. Thompson and Tucker [1985].
    B. C. Thompson and J. V. Tucker, “Theoretical Considerations in Algorithm design,” in Fundamental algorithms for computer graphics, ed. R. A. Earnshaw, pp. 855–878, Springer-Verlag, 1985.Google Scholar
  28. Tucker and Zucker [1987].
    J. V. Tucker and J. Zucker, in Program correctness over abstract data types, with error state semantics, North-Holland, to appear, 1987.Google Scholar
  29. Welch [1983].
    P. H. Welch, “Parallel Assignment Revisited,” Software — Practice and Experience, vol. 13, pp. 1175–1180, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • AR Martin
    • 1
  • JV Tucker
    • 1
  1. 1.Centre for Theoretical Computer Science and Department of Computer StudiesUniversity of LeedsLeedsEngland

Personalised recommendations