## Symbolic Analysis for Parallelizing Compilers (1994)

Citations: | 105 - 4 self |

### BibTeX

@MISC{Haghighat94symbolicanalysis,

author = {Mohammad R. Haghighat and Constantine D. Polychronopoulos},

title = {Symbolic Analysis for Parallelizing Compilers},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

Symbolic Domain The objects in our abstract symbolic domain are canonical symbolic expressions. A canonical symbolic expression is a lexicographically ordered sequence of symbolic terms. Each symbolic term is in turn a pair of an integer coefficient and a sequence of pairs of pointers to program variables in the program symbol table and their exponents. The latter sequence is also lexicographically ordered. For example, the abstract value of the symbolic expression 2ij+3jk in an environment that i is bound to (1; (( " i ; 1))), j is bound to (1; (( " j ; 1))), and k is bound to (1; (( " k ; 1))) is ((2; (( " i ; 1); ( " j ; 1))); (3; (( " j ; 1); ( " k ; 1)))). In our framework, environment is the abstract analogous of state concept; an environment is a function from program variables to abstract symbolic values. Each environment e associates a canonical symbolic value e x for each variable x 2 V ; it is said that x is bound to e x. An environment might be represented by...