A. Cohen, J.-F. Collard, and M. Griebl. Data flow analysis of recursive structures. Technical Report 96/018, Laboratory PRiSM, University of Versailles, France, September 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parallelisation of Data Structures via Static Dependency Analysis - Lewis (1999) (Correct)
....with labelled statements, it is a string of labels from the statements that contain function calls. 3 Current Programming Model I have been working with analysing a fairly restricted programming language that manipulates these structures. This approach seems common for research in this area, see [CCG96a] and [CC96] although some work with fairly unrestricted versions of languages such as C, for example in [HHN94] To illustrate the description there is a fragment of typical code in Fig. 1 The code works with one global data structure. Data elements are accessed via pathnames, which are 2 main ....
....of such predicates, or allow them to be runtime dependent, follow the fuzzy approach. This was discussed earlier in section 4. ffl As with the Group Fields approach, predefine a subset of the potentially infinite structure for the program to operate on. ffl Use recursive constructs as in [CCG96a] to build up a the structure first. The functions then only operate over the values that have been defined. The current approach is closer to the way that recursive structures in C are handled normally. The description allows the structure to be thought of as infinite, but an actual structure ....
A. Cohen, J.-F. Collard, and M. Griebl. Data flow analysis of recursive structures. Technical Report 96/018, Laboratory PRiSM, University of Versailles, France, September 1996.
Dataflow Analysis for Recursive Structures - Tim Lewis June (Correct)
....a particular statement that reads from a point in the data structure, the last statement that wrote to that particular point. They aim to summarise all the data flow information in closed form formulas, independent of the size of the computation. For this they use numbered occurrence languages. [3] extends this approach to recursively defined structures. The data structure is defined by describing a language over some alphabet, and then associating each distinct word with an item of data. In this context they consider trees, multidimensional arrays and almost free shapes, which are the same ....
.... formating language specifies the structure of allowable path names. The format used is similar to the numbered occurrence languages used by [5] This approach obviously restricts the expressiveness of the program, but allows for more accuracy in the solutions. c) Use recursive constructs as in [3] to build up a the structure first. The functions then only operate over the existing values. This is similar to the previous approach, but can allow for more complex sub sets of the structure to be selected. To summarise, there are many existing approaches to extending the description and ....
A. Cohen, J.-F. Collard, and M. Griebl. Data flow analysis of recursive structures. Technical Report 96/018, Laboratory PRiSM, University of Versailles, France, September 1996.
Array Data-flow Analysis for Imperative Recursive Programs - Cohen, Collard, Griebl (1996) (3 citations) Self-citation (Cohen Collard Griebl) (Correct)
....corresponds to the second leaf ( This may indicate a programming error (a non initialized value is being read) w = f:b:b:S ) k = 2 in the last leaf, so w 0 = max (b: f F ;b B ] B GammaF =1;B F2 :S) b:b:S. 6 Recursive data structures We wont discuss here a general technique (see [6] for a more extensive presentation) but only give an interesting application of our data flow analysis framework to a binary tree structure, which is presumably infinite. for i : 0 to p 1 do for j : 0 to q 1 do tree.left(i) right(j) value : tree.left(i 1) right(j) value Figure 4: Example of a ....
A. Cohen, J.-F. Collard, and M. Griebl. Data flow analysis of recursive structures. Technical Report 96/018, Laboratory PRiSM, University of Versailles, France, September 1996.
Fuzzy Array Data-flow Analysis Part II: Recursive Programs - Cohen, Collard (1996) (2 citations) Self-citation (Cohen Collard) (Correct)
....based on a careful coding of possible execution paths as integer parameters or functions and return conservative sets of all possible sources, hence their name Fuzzy Array Data flow Analyses (FADAs) When addressing recursive programs, the same phenomena occur. In our previous work on the subject [11], we had restricted the syntax of input programs, so as to only handle programs with static recursive control . This paper makes the same improvement to dynamic recursive control programs as FADAs do over ADAs. The programs we handle are non mutual recursive programs whose array subscripts are ....
....C i in word w, and by jwj S the number of occurences in w of any letter in a set S. Obviously, w 2 Sigma ) jwj = jwj Sigma = P C i 2 Sigma jwj C i . 3. 2 Numbered occurrences languages To describe sets of words w defined by properties on jwj C i , C i 2 Sigma, the following definitions [11] are in order here. ffl The pumping [C i 1 1 ; C i n n ] of an alphabet Sigma = fC 1 ; Cng by a mapping of Sigma into Zwhich maps C j into i j is the language built of all words containing exactly i j occurrences of C j , for all j. ffl An affine parameterized pumping , ....
A. Cohen, J.-F. Collard, and M. Griebl. Data-flow analysis of recursive structures. submitted to PLDI'97. http://www.prism.uvsq.fr/public/jfcollar/epda.ps.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC