21 search results - page 1 / 5 » Interprocedural Symbolic Range Propagation for Optimizing Co... |
LCPC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
IPPS
1995
IEEE
13 years 8 months ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
LCPC
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
PLDI
2000
ACM
13 years 9 months ago
2000
ACM
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
PPOPP
1999
ACM
13 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...