Download:
|
by Jens Knoop, Bernhard Steffen, Jurgen Vollmer
http://i44www.info.uni-karlsruhe.de/~vollmer/papers/pff.ps.gz
Add To MetaCart
Abstract:
In this paper we show how to construct optimal bitvector analysis algorithms for parallel programs with shared memory that are as efficient as their purely sequential counterparts, and which can easily be implemented. Whereas the complexity result is rather obvious, our optimality result is a consequence of a new Kam/Ullman-style Coincidence Theorem. Thus, the important merits of sequential bitvector analyses survive the introduction of parallel statements.
Citations
|
1266
|
Abstract interpretation : a unified lattice model for the static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
266
|
Flow Analysis of Computer Programs
– Hecht
- 1977
|
|
226
|
A unified approach to global program optimization
– Kildall
- 1973
|
|
216
|
Two approaches to interprocedural data flow analysis
– Sharir, Pnueli
- 1981
|
|
168
|
Global optimization by suppression of partial redundancies
– Morel, Renvoise
- 1979
|
|
136
|
Lazy code motion
– Knoop, Rüthing, et al.
- 1992
|
|
121
|
Monotone data flow analysis frameworks
– Karn, Unman
- 1977
|
|
86
|
Partial Dead Code Elimination
– Knoop, Ruthing, et al.
- 1994
|
|
77
|
The interprocedural coincidence theorem
– Knoop, Steffen
- 1992
|
|
67
|
editors. Program Flow Analysis: Theory and Applications
– Muchnick, Jones
- 1981
|
|
63
|
How to analyse large programs efficiently and informatively
– Dhamdhere, Rosen, et al.
- 1992
|
|
59
|
Control flow analysis
– ALLEN
- 1970
|
|
45
|
Issues in the optimization of parallel programs
– Midkiff, Padua
- 1990
|
|
26
|
Lazy strength reduction
– Knoop, Ruthing, et al.
- 1993
|
|
22
|
A composite hoisting-strength reduction transformation for global program optimization
– Joshi, Dhamdhere
- 1982
|
|
19
|
A new algorithm for composite hoisting and strength reduction optimisation
– Dhamdhere
- 1989
|
|
16
|
Analyzing programs with explicit parallelism
– Srinivasan, Wolfe
- 1992
|
|
9
|
Compile time analysis of parallel programs that share memory
– Chow, Harrison
- 1992
|
|
8
|
Global Expression Optimization During Compilation
– Kildall
- 1972
|
|
8
|
Static single assignment form for explicitly parallel programs
– Srinivasan, Hook, et al.
- 1993
|
|
6
|
Data flow equations for explicitely parallel programs
– Grunwald, Srinivasan
- 1993
|
|
2
|
A variation of Knoop, Ruthing and
– Drechsler, Stadel
- 1993
|
|
1
|
Frameworks for abstract interpretation. Acta Informatica 30
– Marriot
- 1993
|
|
1
|
Programming 21
– Steffen, Burkart, et al.
- 1993
|
