This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cremers, Armin B. and Hibbard, T.N. The Semantic Definition of Programming Languages in Terms of their Data Spaces, 4th Conference on “Programming Languages,” German Computer Society, Erlangen, March 1976, Informatik-Fachberichte 1, Springer-verlag, 1–11, 1976.
-, On the Formal Definition of Dependencies between the Control and Information Structure of a Data Space, Theoretical Computer Science 5, 113–128, 1977.
-, Formal Modelling of Virtual Machines, IEEE Transactions on Software Engineering 4, 426–436, 1978.
-, A Programming Notation for Locally Synchronized Algorithms, in VLSI: Algorithms and Architectures, P. Bertolazzi and F. Luccio, eds., 341–376, North-Holland, 1985.
-, Executable Specification of Concurrent Algorithms in Terms of Applicative Data Space Notation, in VLSI and Modern Signal Processing, S.Y. Kung, H.J. Whitehouse and T. Kailath eds., 200–223, Prentice-Hall, 1985.
-, Subspaces: Factorization and Communication, in Computational and Combinatorial Methods in Systems Theory, Christopher I. Byrnes and Anders Lindquist eds., 383–396, North-Holland 1986.
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cremers, A.B., Hibbard, T.N. (1991). Axioms for concurrent processes. In: Maurer, H. (eds) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol 555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038182
Download citation
DOI: https://doi.org/10.1007/BFb0038182
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54869-0
Online ISBN: 978-3-540-46457-0
eBook Packages: Springer Book Archive