Results 1  10
of
595,290
Interprocedural constant propagation
 In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction
, 1986
"... ..."
FlowSensitive Interprocedural Constant Propagation
 In SIGPLAN Conference on Programming Languages Design and Implementation
, 1995
"... We present a flowsensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flowsensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods and is effici ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
We present a flowsensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flowsensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods
FlowSensitive Interprocedural Constant Propagation
 In SIGPLAN Conference on Programming Languages Design and Implementation
, 1995
"... We present a flowsensitive interprocedural constant propagation algorithm that supports recursion while only performing one flowsensitive analysis of each procedure. We present experimental results which show that this method finds more constants than previous methods and is efficient in practice. ..."
Abstract
 Add to MetaCart
We present a flowsensitive interprocedural constant propagation algorithm that supports recursion while only performing one flowsensitive analysis of each procedure. We present experimental results which show that this method finds more constants than previous methods and is efficient in practice
DemandDriven Interprocedural Constant Propagation: Implementation and Evaluation
, 1994
"... We have developed a hybrid algorithm for interprocedural constant propagation combining two prior methods with a new demanddriven approach. We modified a prior intraprocedural constant propagator to use incrementally in a demanddriven interprocedural framework. We compare our algorithm to three pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We have developed a hybrid algorithm for interprocedural constant propagation combining two prior methods with a new demanddriven approach. We modified a prior intraprocedural constant propagator to use incrementally in a demanddriven interprocedural framework. We compare our algorithm to three
Interprocedural Constant Propagation: A Study of Jump Function Implementations
 IN PROCEEDINGS OF THE ACM SIGPLAN 93 CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION
, 1993
"... An implementation of interprocedural constant propagation must model the transmission of values through each procedure. In the framework proposed by Callahan, Cooper, Kennedy, and Torczon in 1986, this intraprocedural propagation is modeled with a jump function. While Callahan et al. propose several ..."
Abstract

Cited by 48 (5 self)
 Add to MetaCart
An implementation of interprocedural constant propagation must model the transmission of values through each procedure. In the framework proposed by Callahan, Cooper, Kennedy, and Torczon in 1986, this intraprocedural propagation is modeled with a jump function. While Callahan et al. propose
Interprocedural Constant Propagation using Dependence Graphs and a DataFlow Model
 In International Conference on Compiler Construction
, 1994
"... . Aggressive compilers employ a larger number of well understood optimizations in the hope of improving compiled code quality. Unfortunately, these optimizations require a variety of intermediate program representations. A first step towards unifying these optimizations to a common intermediate repr ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
representation is described. The representation chosen is the program dependence graph, which captures both controlflow and dataflow information from a program. The optimization of (interprocedural) constant propagation is studied. The algorithm developed combines a program dependence graph called the system
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
. In addition, the class of problems that our techniques handle includes many nonseparable problems, including trulylive variables, copy constant propagation, and possiblyuninitialized variables. Results are reported from a preliminary experimental study of C programs (for the problem of finding possibly
Constant propagation with conditional branches
 ACM Transactions on Programming Languages and Systems
, 1991
"... Constant propagation is a wellknown global flow analysis problem. The goal of constant propagation is to discover values that are constant on all possible executions of a program and to propagate these constant values as far forward through the program as possible. Expressions whose operands are al ..."
Abstract

Cited by 354 (1 self)
 Add to MetaCart
that performs a form of interprocedural data flow analysis in which aliasing information is gathered in conjunction with constant propagation. Several variants of this algorithm are considered.
ContextSensitive Interprocedural Pointsto Analysis in the Presence of Function Pointers
, 1994
"... This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the pointsto relationships between accessible stack locations, and can be used to generate alias pairs, or used directly for other ..."
Abstract

Cited by 417 (23 self)
 Add to MetaCart
for other analyses and transformations. Our method provides contextsensitive interprocedural information based on analysis over invocation graphs that capture all calling contexts including recursive and mutuallyrecursive calling contexts. Furthermore, the method allows the smooth integration for handling
Results 1  10
of
595,290