Results 261 to 270 of about 2,992,402 (305)
Some of the next articles are maybe not open access.

Structured data flow programming

ACM SIGPLAN Notices, 1982
Although both structured programming (particularly top-down stepwise refinement) [4,7,17] and a data flow view of parallel processing [1,8,11] have been with us now for many years, no attempt has been made to unite the two fields: This paper describes an experiment that unites the two areas in both a textual and a graphical framework.
M. D. de Jong, Chris Hankin
openaire   +1 more source

Data Flow Anomaly Detection

IEEE Transactions on Software Engineering, 1984
The occurrence of a data flow anomaly is often an indication of the existence of a programming error. The detection of such anomalies can be used for detecting errors and to upgrade software quality. This paper introduces a new, efficient algorithm capable of detecting anomalous data flow patterns in a program represented by a graph.
Jacek Jachner, Vinod K. Agarwal
openaire   +1 more source

Cyclo-static data flow

1995 International Conference on Acoustics, Speech, and Signal Processing, 2002
The high sample-rates involved in many DSP-applications, require the use of static schedulers wherever possible. The construction of static schedules however is classically limited to applications that fit in the synchronous data flow model. In this paper we present cyclo-static data flow as a model to describe applications with a cyclically changing ...
Greet Bilsen   +3 more
openaire   +1 more source

A Lubricant for Data Flow Analysis

SIAM Journal on Computing, 1982
This paper deals with concepts recently introduced to avoid duplication of effort when several global data flow problems share the same underlying control flow. The flow scheme is the control flow portion of the input to data flow analysis. By finding a family of formal expressions called a flow cover for a given flow scheme, one can be ready to solve ...
openaire   +2 more sources

Nets and data flow interpreters

[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
The authors investigate and compare two ways of specifying stream relations (in particular, stream functions). The first uses relational programs, i.e., netlike program schemes in which the signature primitives are interpreted as relations over a given CPO. No stream domains are assumed; semantics is in fixed-point style.
Alexander Moshe Rabinovich   +1 more
openaire   +1 more source

Data-Flow Testing in the Large

2014 IEEE Seventh International Conference on Software Testing, Verification and Validation, 2014
Data-flow (DF) testing was introduced more than thirty years ago aiming at extensively evaluating a program structure. It requires tests that traverse a path in which the definition of a variable and its subsequent use, i.e., a definition-use association (dua), is exercised.
Roberto Paulo Andrioli de Araujo   +1 more
openaire   +1 more source

The Stollmann Data Flow Machine

1988
Most of the data flow architectures proposed in the last years aim at number crunching, which naturally seems to imply fine grain paralellism. Just so fine grain seems to lead naturally to (expensive) special hardware. Our aim is to adapt the data flow concept to commercial applications as for example from the database field.
Michael Jöhnk, Ute Schürfeld
openaire   +1 more source

Decomposition of data flow diagrams

Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering, 2003
Data flow diagrams are an important design aid in system development. CASE tools allow data flow diagram construction and modification to be automated. Decomposition is the top-down development of a data flow diagram starting with the system inputs and the system outputs. Decomposition may also be automated, resulting in an interactive process for data
Timothy Arndt, Angela Guercio
openaire   +1 more source

DFL: A Data Flow Language

Computer Languages, 1984
Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The effective utilization of the machines makes special demands on programmers and their programming languages, such as the structuring of data into vectors or the ...
Lalit M. Patnaik   +2 more
openaire   +1 more source

Nets of processes and data flow

1989
Nets of Processes provide a unifying approach to semantics of concurrently executing agents. In this framework modularity and Kahn's principle are investigated for Data Flow Networks.
Alexander Moshe Rabinovich   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy