This research was done at Project MAC, MIT, and was supported in part by the National Science Foundation under grant GJ-432 and in part by the Advanced Research Projects Agency, Department of Defense, under Office of Naval Research Contract Nonr-N00014-70-A-0362-0001.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ashcroft, E., and Manna, Z. The translation of ‘go to’ programs to ‘while’ programs. Information Processing 71, Ljubljana. 1971.
Cooper, D. C. Programs for mechanical program verification. Machine Intelligence, Vol. 6, Edinburgh University Press, 1970.
Dennis, J. B. Programming generality, parallelism and computer architecture. Information Processing 68, North-Holland, Amsterdam 1969, pp 484–492.
Engeler, E. Structure and meaning of elementary programs. Symposium on the Semantics of Algorithmic Languages, 1970
Fosseen, J. B. Representation of Algorithms by Maximally Parallel Schemata. M.S. Thesis, Massachusetts Institute of Technology, Cambridge, Mass., June 1972.
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.
Keller, R. M. On maximally parallel schemata. IEEE Conference Record, Eleventh Annual Symposium on Switching and Automata Theory, October 1970, pp 32–50.
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.
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.
Paterson, M. S. Equivalence Problems in a Model of Computation. Ph.D. Thesis, Trinity College, University of Cambridge, 1967.
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.
Rodriguez, J. E. A Graph Model for Parallel Computation. Report MAC-TR-64, Project MAC, M.I.T., Cambridge, Mass., September 1969.
Slutz, D. R. The Flow Graph Schemata of Parallel Computations. Report MAC-TR-53, Project MAC, M.I.T., Cambridge, Mass., September 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dennis, J.B., Fosseen, J.B., Linderman, J.P. (1974). Data flow schemas. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-06720-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06720-7
Online ISBN: 978-3-540-38012-2
eBook Packages: Springer Book Archive