{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:25:23Z","timestamp":1726406723997},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176541"},{"type":"electronic","value":"9783540477402"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17654-3_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:16:05Z","timestamp":1330197365000},"page":"331-355","source":"Crossref","is-referenced-by-count":2,"title":["A formal semantics for a DataFlow Machine \u2014 Using VDM"],"prefix":"10.1007","author":[{"given":"Kevin D.","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"E.A. Ashcroft and W. Wadge. LUCID \u2014 a non-procedural language with iteration. CACM, 20(7), 1977.","DOI":"10.1145\/359636.359715"},{"key":"19_CR2","first-page":"252","volume":"107","author":"Brock and Ackerman","year":"1981","unstructured":"Brock and Ackerman. Scenarios \u2014 a model for non-determinate computation. In LNCS 107, pages 252\u2013259, Springer-Verlag, 1981.","journal-title":"LNCS"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"J. Backus. Can programming be liberated form the von neumann style? CACM, 21(8), 1978.","DOI":"10.1145\/359576.359579"},{"key":"19_CR4","unstructured":"A. Blikle. Concurrent distributed processes. 1983."},{"key":"19_CR5","unstructured":"D.L. Bowen. The Implementation of Data Structures in a Dataflow Computer. PhD thesis, University of Manchester, 1981."},{"key":"19_CR6","unstructured":"M. Broy. Fixed point theory for communication and concurrency. In Proc of TC2 Working Conference on Formal Description of Programming Concepts II, IFIP, 1982."},{"key":"19_CR7","unstructured":"V.J. Bush. A survey of the use of matching functions. 1983."},{"key":"19_CR8","unstructured":"A.J. Catto. Non-Deterministic Programming in a Dataflow Environment. PhD thesis, University of Manchester, 1981."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"A.L. Davies. The architecture and system method of DDM1. In Proc. 5 th Annual Symposium on Computer Architecture, pages 210\u2013215, 1978.","DOI":"10.1145\/800094.803050"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"J.B. Dennis, J.B. Fossen, and J.P. Linderman. Dataflow schemas. In LNCS 5, Springer-Verlag, 1974.","DOI":"10.1007\/3-540-06720-5_15"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"A. Faustini. The Equivalence of an Operational and a Denotational Semantics for Pure Dataflow Programs. PhD thesis, University of Warwick, 1982.","DOI":"10.1007\/BFb0012771"},{"key":"19_CR12","unstructured":"J.R. Gurd. Manchester prototype dataflow system description. 1982."},{"key":"19_CR13","unstructured":"J.R. Gurd and I. Watson. A data driven system for high speed parallel computing. Computer Design, 19(6\u20137), 1980."},{"key":"19_CR14","unstructured":"J.R. Gurd and I. Watson. Priliminary evaluation of a prototype dataflow computer. In Proc. IFIP 83, North Holland, 1983."},{"key":"19_CR15","unstructured":"P. Hitchcock. An Approach to Formal Reasoning about Programs. PhD thesis, University of Warwick, 1974."},{"key":"19_CR16","unstructured":"P. Hitchcock and D. Park. Induction rules and termination proofs. In IRIA Proc., 1972."},{"key":"19_CR17","unstructured":"C.B. Jones. Formal Development of Programs. Technical Report TR12.117, IBM Hursley, 1973."},{"key":"19_CR18","unstructured":"C.B. Jones. Development Methods for Computer Programs \u2014 including a Notion of Interference. PhD thesis, University of Oxford, 1981."},{"key":"19_CR19","unstructured":"Cliff B. Jones. Systematic Software Development using VDM. Prentice Hall International, 1986."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"C.B. Jones. VDM proof obligations and their justification. In this volume, 1987.","DOI":"10.1007\/3-540-17654-3_15"},{"key":"19_CR21","unstructured":"K.D.Jones. The Application of a Formal Development Method to a Parallel Machine Environment. PhD thesis, The University of Manchester, 1985."},{"key":"19_CR22","unstructured":"C.C. Kirkham. The basic programmers manual. 1981."},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1137\/0114108","volume":"14","author":"R.M. Karp","year":"1966","unstructured":"R.M. Karp and R.E. Miller. Properties of a model for parallel computing. SIAM. Journal of Applied Maths, 14:1390\u20131417, 1966.","journal-title":"SIAM. Journal of Applied Maths"},{"key":"19_CR24","unstructured":"P.R. Kosinski. A straightforward non-deterministic semantics for dataflow programs. In Proc. 5 th Annual Symposium on Principles of Programming Languages, 1978."},{"key":"19_CR25","unstructured":"J. Oliveira. A Semantics for Deterministic Dataflow Programs. PhD thesis, University of Manchester, 1984."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"D. Park. On the semantics of fair parallelism. In LNCS 86, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10007-5_47"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"G.D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3), 1976.","DOI":"10.1137\/0205035"},{"key":"19_CR28","unstructured":"J. Sargeant. Efficient Stored Data Structures for Dataflow Computing. PhD thesis, University of Manchester, 1985."},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M.B. Smyth","year":"1978","unstructured":"M.B. Smyth. Powerdomains. Journal of Computer System Sciences, 16:23\u201326, 1978.","journal-title":"Journal of Computer System Sciences"},{"key":"19_CR30","unstructured":"J.E. Stoy. Denotational Semantics. MIT Press, 1977."},{"key":"19_CR31","unstructured":"J.R. Gurd V.J. Bush and J. Oliviera. FP as a basis for dataflow program transformation. 1983."},{"key":"19_CR32","unstructured":"A.H. Veen. A Formal Model for Dataflow Programs with Token Colouring. Technical Report IW 179\/81, Mathematisch Centrum, 1981."}],"container-title":["Lecture Notes in Computer Science","VDM '87 VDM \u2014 A Formal Method at Work"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17654-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:07Z","timestamp":1605643987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17654-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176541","9783540477402"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-17654-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}