A Formal Semantics for a DataFlow Machine - Using VDM

This paper presents a formal description of a non-conventional machine architecture (The Manchester DataFlow Machine) in the denotational style, using an extension of the traditional VDM methods.

[1]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[2]  Cliff B. Jones,et al.  VDM Proof Obligations and their Justification , 1987, VDM Europe.

[3]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[4]  A. L. Davis,et al.  The architecture and system method of DDM1: A recursively structured Data Driven Machine , 1978, ISCA '78.

[5]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[6]  Antony A. Faustini.  An Operational Semantics for Pure Dataflow , 1982, ICALP.

[7]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[8]  Ian Watson,et al.  Preliminary Evaluation of a Prototype Dataflow Computer , 1983, IFIP Congress.

[9]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[10]  Joe Stoy,et al.  Denotational Semantics , 1977 .

[11]  Jack B. Dennis,et al.  Data flow schemas , 1972, International Sympoisum on Theoretical Programming.

[12]  Cliff B. Jones,et al.  Formal development of programs , 1973 .

[13]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[14]  William W. Wadge,et al.  Lucid, a nonprocedural language with iteration , 1977, CACM.

[15]  Peter Hitchcock.  An approach to formal reasoning about programs , 1974 .

[16]  Paul R. Kosinski,et al.  A straightforward denotational semantics for non-determinate data flow programs , 1978, POPL 1978.