{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:34:02Z","timestamp":1648881242241},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            We show that a given dataflow language\n            <jats:italic>l<\/jats:italic>\n            has the property that for any program\n            <jats:italic>P<\/jats:italic>\n            and any demand for outputs\n            <jats:italic>D<\/jats:italic>\n            (which can be satisfied) there exists a least partial computation of\n            <jats:italic>P<\/jats:italic>\n            which satisfies\n            <jats:italic>D<\/jats:italic>\n            , iff all the operators of\n            <jats:italic>l<\/jats:italic>\n            are stable. This minimal computation is the demand-driven evaluation of\n            <jats:italic>P<\/jats:italic>\n            . We also argue that in order to actually implement this mode of evaluation, the operators of\n            <jats:italic>l<\/jats:italic>\n            should be further restricted to be effectively sequential ones.\n          <\/jats:p>","DOI":"10.1007\/bf03259389","type":"journal-article","created":{"date-parts":[[2012,11,10]],"date-time":"2012-11-10T01:08:19Z","timestamp":1352509699000},"page":"620-642","source":"Crossref","is-referenced-by-count":0,"title":["Stability, Sequentiality and Demand Driven Evaluation in Dataflow"],"prefix":"10.1145","volume":"6","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[{"name":"Raymond and Beverly Sackler Faculty of Exact Sciences, Computer Science Department, Tel Aviv University, 69978, Ramat-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nada","family":"Sasson","sequence":"additional","affiliation":[{"name":"Raymond and Beverly Sackler Faculty of Exact Sciences, Computer Science Department, Tel Aviv University, 69978, Ramat-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","volume-title":"Some Relationships Between Asynchronous Interpreters of a Dataflow Language","author":"Arvind","year":"1977"},{"key":"e_1_2_1_2_2_2","first-page":"47","volume-title":"Bottom-up Computation of Recursive Programs","author":"Berry G","year":"1976"},{"key":"e_1_2_1_2_3_2","volume-title":"Sequentialit\u00e9 de \u00c9valuation Formelle des \u03bb-expressions","author":"Berry G","year":"1978"},{"key":"e_1_2_1_2_4_2","first-page":"72","volume-title":"Stable Models of typed lambda \u2014 calculi","author":"Berry G","year":"1978"},{"key":"e_1_2_1_2_5_2","volume-title":"Mod\u00e8les compl\u00e8tement ad\u00e9quateet Stable des \u03bb-calculus typ\u00e9s","author":"Berry G","year":"1979"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(84)90016-9"},{"key":"e_1_2_1_2_7_2","volume-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien P","year":"1985"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/901184"},{"key":"e_1_2_1_2_9_2","unstructured":"IEEE. Special issue on Dataflow Systems. IEEE Comput. 15 2 Feb 1982."},{"key":"e_1_2_1_2_10_2","first-page":"331","volume":"254","author":"Jones K","year":"1987","journal-title":"A Formal Semantics for a Dataflow Machine \u2014 Using VDM"},{"key":"e_1_2_1_2_11_2","first-page":"471","volume":"74","author":"Kahn G","year":"1974","journal-title":"The Semantics of a Simple Language for a Parallel Programming"},{"key":"e_1_2_1_2_12_2","unstructured":"Kahn G. and Plotkin G.: Structures de donn\u00e9es concr\u00e8tes . Rapport IRIA \u2014 LABORIA 336 (D)."},{"key":"e_1_2_1_2_13_2","unstructured":"Keller R.M.: Denotational Models for Parallel Programs with Indeterminate Operators . Formal Descriptions of Programming Concepts E.J. Neuhold (ed.) pp. 337\u2013366 North Holland 1978."},{"key":"e_1_2_1_2_14_2","first-page":"214","volume-title":"A Straightforward Denotational Semantics for Non-determinate Data Flow Programs","author":"Kosinski PR","year":"1978"},{"key":"e_1_2_1_2_15_2","first-page":"81","volume":"82","author":"Linch N A","year":"1989","journal-title":"A Proof of the Kahn Principle for I\/O Automata"},{"key":"e_1_2_1_2_16_2","volume-title":"The Foundations of Program Verification","author":"Loeckx J","year":"1984"},{"key":"e_1_2_1_2_17_2","volume-title":"A Theory of Programming Language Semantics","author":"Milne R","year":"1976"},{"issue":"1","key":"e_1_2_1_2_18_2","first-page":"1","volume":"4","author":"Milner R","year":"1977","journal-title":"Fully Abstract Models of Typed \u03b1-calculi"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28115468"},{"issue":"2","key":"e_1_2_1_2_20_2","first-page":"311","volume":"7","author":"Pingali K","year":"1985","journal-title":"Efficient Demand-Driven Evaluation part 1"},{"key":"e_1_2_1_2_21_2","volume-title":"Demand Driven Evaluation on Dataflow Machines","author":"Pingali K","year":"1986"},{"key":"e_1_2_1_2_22_2","volume-title":"A Dataflow Implementation of SASL","author":"Richmond G","year":"1982"},{"key":"e_1_2_1_2_23_2","volume-title":"A Theory of Programs","author":"Scott D","year":"1969"},{"key":"e_1_2_1_2_24_2","first-page":"169","volume-title":"Outlines of Mathematical Theory of Computation","author":"Scott D","year":"1970"},{"key":"e_1_2_1_2_25_2","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics","author":"Stoy J","year":"1977"},{"key":"e_1_2_1_2_26_2","first-page":"411","volume":"32","author":"Trakhtenbrot A","year":"1975","journal-title":"On Representation of Sequential and Parallel Functions"},{"key":"e_1_2_1_2_27_2","volume-title":"Topics in Typed Programming Languages, Lecture Notes","author":"Trakhtenbrot B","year":"1985"},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380090105"},{"key":"e_1_2_1_2_29_2","volume-title":"Ph.D Thesis","author":"Vuillemin J","year":"1973"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03259389.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03259389\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF03259389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:29:53Z","timestamp":1641482993000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF03259389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1007\/BF03259389"],"URL":"https:\/\/doi.org\/10.1007\/bf03259389","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}