Axioms for concurrent processes

  • Armin B. Cremers
  • Thomas N. Hibbard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 555)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    -, On the Formal Definition of Dependencies between the Control and Information Structure of a Data Space, Theoretical Computer Science 5, 113–128, 1977.Google Scholar
  3. 3.
    -, Formal Modelling of Virtual Machines, IEEE Transactions on Software Engineering 4, 426–436, 1978.Google Scholar
  4. 4.
    -, A Programming Notation for Locally Synchronized Algorithms, in VLSI: Algorithms and Architectures, P. Bertolazzi and F. Luccio, eds., 341–376, North-Holland, 1985.Google Scholar
  5. 5.
    -, 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.Google Scholar
  6. 6.
    -, Subspaces: Factorization and Communication, in Computational and Combinatorial Methods in Systems Theory, Christopher I. Byrnes and Anders Lindquist eds., 383–396, North-Holland 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Armin B. Cremers
  • Thomas N. Hibbard

There are no affiliations available

Personalised recommendations