Sciweavers

153 search results - page 1 / 31
» Solving Demand Versions of Interprocedural Analysis Problems
Sort
View
CC
1994
Springer
107views System Software» more  CC 1994»
13 years 9 months ago
Solving Demand Versions of Interprocedural Analysis Problems
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g...
Thomas W. Reps
POPL
2007
ACM
14 years 5 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
IEEEPACT
2000
IEEE
13 years 9 months ago
Region Formation Analysis with Demand-Driven Inlining for Region-Based Optimization
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
Tom Way, Ben Breech, Lori L. Pollock
ANOR
2005
120views more  ANOR 2005»
13 years 4 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
FOSSACS
2009
Springer
13 years 8 months ago
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
Morten Kühnrich, Stefan Schwoon, Jirí ...