... a **data** path is tested at least once within their ...scheduled **data** **flow** graph is utilized to estimate the number of FUs and their idle periods in which certain testing operations are scheduled ...

10

... 6.3.1 Definition of S DVG Graphs can be used to describe many structures in computer science: program control flows, communication processes, computer networks, pointer structure on the heap and many oth- ers. In fact, ...

195

... various **data**-**flow** image processing effects, such as blending, warping and scaling, an instrument cluster system improves driver experience with useful and high quality 2D/3D Human-Machine Interface ...

11

... The Language Signal [ 3 , 7 ] is a synchronous **data**-**flow** language that allows the specification of multi-clocked systems. Signal handles unbounded sequences of typed values (x(t)) t∈N , called signals, ...

16

... by **data** dependencies), and of the temporal aspects ...a **flow** of **data**, multi-rate parallel computations), for which there is no well-founded support or ...synchronous **data** **flow** language ...

34

... synchronous **data**- **flow** languages such as L USTRE [10] or S IGNAL [8] have been introduced and successfully used to design and implement em- bedded software architectures and critical real-time ...

10

... The present paper provides a verification framework to prove the value- equivalence of variables and applies this approach to the synchronous **data**-**flow** compiler Signal. With the simplicity of the graph ...

23

... The Data Flow Machine would generate a set of streams where each stream is the sequence of intensity values for each pixel in a given column of the image array.. [r] ...

28

... ulate. Moreover, a direct consequence of this result is that it is not possible to determine whether a Scufl workflow will complete or not. Beyond those theoretical considerations, we pre- sented an example of a ...

7

... optimization **flow**. It transforms the **data** **flow** graph extracted from the initial specification into an opti- mized DFG using a host of TED-based decomposition and DFG optimization techniques, and ...

9

... Abstract : A future is a place-holder for a value being computed, and we generally say that a future is resolved when the associated value is computed. In existing languages futures are either implicit, if there is no ...

43

... Parametric **Data** **Flow** (BPDF) model which combines integer parameters (to express dynamic rates) and boolean parameters (to express the activation and deactivation of communication ...

25

... Chapter 8 Conclusion and Perspectives Conclusion In recent decades, electronic embedded systems have revolutionized our societies in daily lives. The increase in the application demands and the fast improvement in ...

192

... to **data**-**flow** analysis and we apply these ideas to interval ...generic **data**-**flow** analysis framework, and we establish several links between the resulting ...for **data**-**flow** anal- ...

21

... interpretation-based **data**-**flow** analysis, widening opera- tors are usually used in order to speed up the iterative computation of the mini- mum fix-point solution ...control- **flow** cycle in order to ...

23

... The remainder of this paper is organized as follows. Sec- tion 2 introduces the Signal language. Section 3 presents the abstraction that represents the clock constraints in terms of first-order logic formulas. The ...

18

... The idea consists in introducing the concept of running modes into Scade models to facilitate the specification of the mainly regular systems and to give a more readable design methodolo[r] ...

36

... The following data has been collected: number of nodes, number of node executions per steady state, schedule size and buffer size for pseudo single appearance and [r] ...

109

... This paper introduces open closure types, that is, function types that are deco- rated with type contexts. They are used to track **data**-ﬂow from the environment into the function closure. A simply-typed lambda ...

28

... Property 4-2: A rCq schema will always produce congruent histories at fault- free outputs in a bounded amount of time whenever all restoring buffers and associated time-o[r] ...

83