Data flow schemas

  • J. B. Dennis
  • J. B. Fosseen
  • J. P. Linderman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5)


Output Node Input Node Data Path Output Link Firing Rule 
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. 1.
    Ashcroft, E., and Manna, Z. The translation of ‘go to’ programs to ‘while’ programs. Information Processing 71, Ljubljana. 1971.Google Scholar
  2. 2.
    Cooper, D. C. Programs for mechanical program verification. Machine Intelligence, Vol. 6, Edinburgh University Press, 1970.Google Scholar
  3. 3.
    Dennis, J. B. Programming generality, parallelism and computer architecture. Information Processing 68, North-Holland, Amsterdam 1969, pp 484–492.Google Scholar
  4. 4.
    Engeler, E. Structure and meaning of elementary programs. Symposium on the Semantics of Algorithmic Languages, 1970Google Scholar
  5. 5.
    Fosseen, J. B. Representation of Algorithms by Maximally Parallel Schemata. M.S. Thesis, Massachusetts Institute of Technology, Cambridge, Mass., June 1972.Google Scholar
  6. 6.
    Karp, R. M., and Miller, R. E. Parallel program schemata. J. of Computer and System Sciences, Vol. 3, No. 2, May 1969, pp 147–195.Google Scholar
  7. 7.
    Keller, R. M. On maximally parallel schemata. IEEE Conference Record, Eleventh Annual Symposium on Switching and Automata Theory, October 1970, pp 32–50.Google Scholar
  8. 8.
    Knuth, D. E., and Floyd, R. W. Notes on avoiding "go to" statements. Information Processing Letters 1, North-Holland Publishing Co., Amsterdam 1971, pp 23–31.Google Scholar
  9. 9.
    Luckham, D. C., Park, D. M. R., and Paterson, M. S. On formalised computer programs. J. of Computer and System Sciences, Vol. 4, No. 3 (June 1970), pp 220–249.Google Scholar
  10. 10.
    Paterson, M. S. Equivalence Problems in a Model of Computation. Ph.D. Thesis, Trinity College, University of Cambridge, 1967.Google Scholar
  11. 11.
    Patil, S. S. Closure properties of interconnections of determinate systems. Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, ACM, New York 1970, pp 107–116.Google Scholar
  12. 12.
    Rodriguez, J. E. A Graph Model for Parallel Computation. Report MAC-TR-64, Project MAC, M.I.T., Cambridge, Mass., September 1969.Google Scholar
  13. 13.
    Slutz, D. R. The Flow Graph Schemata of Parallel Computations. Report MAC-TR-53, Project MAC, M.I.T., Cambridge, Mass., September 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • J. B. Dennis
    • 1
  • J. B. Fosseen
    • 1
  • J. P. Linderman
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridge

Personalised recommendations