This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Gregory R. Andrews, “The Distributed Programming Language SR — Mechanisms, Design and Implementation,” Software — Practice and Experience, vol. 12, pp. 719–753, 1982.
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.
Jaco de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall International, 1980.
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.
R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985.
K. Mani Chandy and Jayadev Misra, Parallelism and Programming: The Proper Perspective, Computer Studies Departmental report, University of Texas at Austin, 1985.
K. Mani Chandy and J. Misra, “Systolic Algorithms as Programs”, in Distributed Computing, vol. 1, Springer-Verlag, 1986.
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.
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.
Edsgar W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.
Amos Fiat and Adi Shamir, “Polymorphic Arrays: A novel VLSI layout for Systolic Computers,” in 25th FOCS, pp. 37–45, IEEE, 1984.
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.
D. Gries, “The Multiple Assignment Statement,” IEEE Transactions on Software Engineering, vol. SE-4, pp. 89–93, 1978.
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.
C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.
C. Jervis, On the Specification, Implementation and Verification of Data Types, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.
H. T. Kung, “Why Systolic Architectures?”, Computer, vol. 15, no. 1, pp. 37–46, 1982.
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.
A. J. Martin, “The Torus: An Exercise in Constructing a Processing Surface,” in Caltech Conference on VLSI, 1981.
C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, 1980.
K. Meinke, A Mathematical Theory of Computation for Synchronous Circuits, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.
Frances L. Van Scoy, “The Parallel Recognition of Graphs,” IEEE Trans. on Computers, vol. C-29, no. 7, pp. 363–370, July, 1980.
C. H. Sequin, “Doubly Twisted Torus Networks for VLSI Processor Arrays,” in Eigth Annual Symposium on Computer Architecture, Minneapolis, Minnesota., 1981.
Lawrence Snyder, “Parallel Programming and the Poker Programming Environment,” Computer, vol. 17, no. 7, pp. 27–36, July, 1984.
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.
Ben Thompson, Foundation of Compilation for VLSI Systems, PhD Thesis, Department of Computer Studies, The University of Leeds, to appear, 1987.
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.
J. V. Tucker and J. Zucker, in Program correctness over abstract data types, with error state semantics, North-Holland, to appear, 1987.
P. H. Welch, “Parallel Assignment Revisited,” Software — Practice and Experience, vol. 13, pp. 1175–1180, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, A., Tucker, J. (1987). The concurrent assignment representation of synchronous systems. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17945-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-17945-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17945-0
Online ISBN: 978-3-540-47181-3
eBook Packages: Springer Book Archive