Sciweavers

173 search results - page 21 / 35
» Interprocedural analysis of asynchronous programs
Sort
View
CC
2008
Springer
172views System Software» more  CC 2008»
15 years 1 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
ICS
1994
Tsinghua U.
15 years 3 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley
CGO
2004
IEEE
15 years 3 months ago
SYZYGY - A Framework for Scalable Cross-Module IPO
Performing analysis across module boundaries for an entire program is important for exploiting several runtime performance opportunities. However, due to scalability problems in e...
Sungdo Moon, Xinliang D. Li, Robert Hundt, Dhruva ...
LCPC
2005
Springer
15 years 5 months ago
Scalable Array SSA and Array Data Flow Analysis
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
Silvius Rus, Guobin He, Lawrence Rauchwerger
PLDI
2009
ACM
16 years 9 days ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...