Albert Cohen, Jean-Francois Collard, and Martin Griebl. Array data-flow analysis 14 for imperative recursive programs. Technical Report 96/035, Laboratory PRiSM, University of Versailles, France, 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)
....values that are scalar data items (int, real, etc . this is straightforward, we can augment the global structure so that the data can be passed through it. Arrays To include arrays in our model, we need to include much the work that has been done for dataflow analysis of arrays, see [CCG96b] for an analysis of recursive functions over arrays. This is worth doing, but would require a considerable amount of work. Recursion in non generator directions This awkward restriction reduces the ability to express algorithms. Relaxing this would require us to use a more general model for ....
Albert Cohen, Jean-Francois Collard, and Martin Griebl. Array data-flow analysis 14 for imperative recursive programs. Technical Report 96/035, Laboratory PRiSM, University of Versailles, France, 1996.
Dataflow Analysis for Recursive Structures - Tim Lewis June (Correct)
....statically analysed where compile time knowledge is incomplete. 2.5 Static Analysis We now turn to the problem of performing static analysis of programs written over these general structures. We will be considering recursive functions, and the style will be imperative, rather than functional. [5] deals with the analysis of array structures, when the program is of the form of a recursive procedure. The procedures consist of sequences of read write statements or recursive calls. Each call has a recursion guard, a predicate that decides whether the call occurs. Each call is labelled from an ....
....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 as our commuting structures. The recursive program structures that they use are simpler than in [5]. A procedure consists of explore constructs that specify a recursion direction and a predicate over the control word. This has the advantage that the body of the procedure is executed if, and only if, the predicates in the recurse statements hold. The sources are described using the numbered ....
[Article contains additional citation context not shown here]
Albert Cohen, Jean-Francois Collard, and Martin Griebl. Array dataflow analysis for imperative recursive programs. Technical Report 96/035, Laboratory PRiSM, University of Versailles, France, 1996.
Static Analysis of Recursive Data Structures - Arvind And Lewis (1998) (1 citation) (Correct)
....proposed for a class of graph structures, where the regularity is described by the programmer via a Markov algorithm. The method is illustrated with an example. 1 Motivation The static analysis of programs involving arrays with a view towards their automatic parallelisation has been studied in [2]. In contrast, the static analysis of pointer based data structures is relatively more complicated. These structures can be viewed as a graph of values, with no restrictions placed on which values the pointers point to. In practice, they may often resemble trees or lists, but there is no ....
Albert Cohen, Jean-Francois Collard, and Martin Griebl. Array data-flow analysis for imperative recursive programs. Technical Report 96/035, Laboratory PRiSM, University of Versailles, France, 1996.
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