Skip to main content
SpringerLink
Log in

A formal semantics for a DataFlow Machine — Using VDM

  • A Case Study
  • Conference paper
  • First Online:
VDM '87 VDM — A Formal Method at Work (VDM 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 252))

Included in the following conference series:

Abstract

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.

The semantics is defined in terms of two fixed-point expressions over a relational domain. Some general and specific properties of such a semantics are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.A. Ashcroft and W. Wadge. LUCID — a non-procedural language with iteration. CACM, 20(7), 1977.

    Google Scholar 

  2. Brock and Ackerman. Scenarios — a model for non-determinate computation. In LNCS 107, pages 252–259, Springer-Verlag, 1981.

    Google Scholar 

  3. J. Backus. Can programming be liberated form the von neumann style? CACM, 21(8), 1978.

    Google Scholar 

  4. A. Blikle. Concurrent distributed processes. 1983.

    Google Scholar 

  5. D.L. Bowen. The Implementation of Data Structures in a Dataflow Computer. PhD thesis, University of Manchester, 1981.

    Google Scholar 

  6. M. Broy. Fixed point theory for communication and concurrency. In Proc of TC2 Working Conference on Formal Description of Programming Concepts II, IFIP, 1982.

    Google Scholar 

  7. V.J. Bush. A survey of the use of matching functions. 1983.

    Google Scholar 

  8. A.J. Catto. Non-Deterministic Programming in a Dataflow Environment. PhD thesis, University of Manchester, 1981.

    Google Scholar 

  9. A.L. Davies. The architecture and system method of DDM1. In Proc. 5 th Annual Symposium on Computer Architecture, pages 210–215, 1978.

    Google Scholar 

  10. J.B. Dennis, J.B. Fossen, and J.P. Linderman. Dataflow schemas. In LNCS 5, Springer-Verlag, 1974.

    Google Scholar 

  11. A. Faustini. The Equivalence of an Operational and a Denotational Semantics for Pure Dataflow Programs. PhD thesis, University of Warwick, 1982.

    Google Scholar 

  12. J.R. Gurd. Manchester prototype dataflow system description. 1982.

    Google Scholar 

  13. J.R. Gurd and I. Watson. A data driven system for high speed parallel computing. Computer Design, 19(6–7), 1980.

    Google Scholar 

  14. J.R. Gurd and I. Watson. Priliminary evaluation of a prototype dataflow computer. In Proc. IFIP 83, North Holland, 1983.

    Google Scholar 

  15. P. Hitchcock. An Approach to Formal Reasoning about Programs. PhD thesis, University of Warwick, 1974.

    Google Scholar 

  16. P. Hitchcock and D. Park. Induction rules and termination proofs. In IRIA Proc., 1972.

    Google Scholar 

  17. C.B. Jones. Formal Development of Programs. Technical Report TR12.117, IBM Hursley, 1973.

    Google Scholar 

  18. C.B. Jones. Development Methods for Computer Programs — including a Notion of Interference. PhD thesis, University of Oxford, 1981.

    Google Scholar 

  19. Cliff B. Jones. Systematic Software Development using VDM. Prentice Hall International, 1986.

    Google Scholar 

  20. C.B. Jones. VDM proof obligations and their justification. In this volume, 1987.

    Google Scholar 

  21. K.D.Jones. The Application of a Formal Development Method to a Parallel Machine Environment. PhD thesis, The University of Manchester, 1985.

    Google Scholar 

  22. C.C. Kirkham. The basic programmers manual. 1981.

    Google Scholar 

  23. R.M. Karp and R.E. Miller. Properties of a model for parallel computing. SIAM. Journal of Applied Maths, 14:1390–1417, 1966.

    Google Scholar 

  24. P.R. Kosinski. A straightforward non-deterministic semantics for dataflow programs. In Proc. 5 th Annual Symposium on Principles of Programming Languages, 1978.

    Google Scholar 

  25. J. Oliveira. A Semantics for Deterministic Dataflow Programs. PhD thesis, University of Manchester, 1984.

    Google Scholar 

  26. D. Park. On the semantics of fair parallelism. In LNCS 86, Springer-Verlag, 1980.

    Google Scholar 

  27. G.D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3), 1976.

    Google Scholar 

  28. J. Sargeant. Efficient Stored Data Structures for Dataflow Computing. PhD thesis, University of Manchester, 1985.

    Google Scholar 

  29. M.B. Smyth. Powerdomains. Journal of Computer System Sciences, 16:23–26, 1978.

    Google Scholar 

  30. J.E. Stoy. Denotational Semantics. MIT Press, 1977.

    Google Scholar 

  31. J.R. Gurd V.J. Bush and J. Oliviera. FP as a basis for dataflow program transformation. 1983.

    Google Scholar 

  32. A.H. Veen. A Formal Model for Dataflow Programs with Token Colouring. Technical Report IW 179/81, Mathematisch Centrum, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University, Manchester, England

    Kevin D. Jones

Authors
  1. Kevin D. Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Cliff B. Jones Mícheál Mac an Airchinnigh Erich J. Neuhold

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jones, K.D. (1987). A formal semantics for a DataFlow Machine — Using VDM. In: Bjørner, D., Jones, C.B., Mac an Airchinnigh, M., Neuhold, E.J. (eds) VDM '87 VDM — A Formal Method at Work. VDM 1987. Lecture Notes in Computer Science, vol 252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17654-3_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-17654-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17654-1

  • Online ISBN: 978-3-540-47740-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation