• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,890
Next 10 →

Interprocedural constant propagation

by David Callahan, Keith D. Cooper, Ken Kennedy - In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction , 1986
"... ..."
Abstract - Cited by 89 (15 self) - Add to MetaCart
Abstract not found

Flow-Sensitive Interprocedural Constant Propagation

by Paul R. Carini, Michael Hind - In SIGPLAN Conference on Programming Languages Design and Implementation , 1995
"... We present a flow-sensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flow-sensitive 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 flow-sensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flow-sensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods

Flow-Sensitive Interprocedural Constant Propagation

by Flow-sensitive Interprocedural, Constant Propagation, Paul R. Carini, Paul R. Carini, Michael Hind, Michael Hind - In SIGPLAN Conference on Programming Languages Design and Implementation , 1995
"... We present a flow-sensitive interprocedural constant propagation algorithm that supports recursion while only performing one flow-sensitive 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 flow-sensitive interprocedural constant propagation algorithm that supports recursion while only performing one flow-sensitive analysis of each procedure. We present experimental results which show that this method finds more constants than previous methods and is efficient in practice

Demand-Driven Interprocedural Constant Propagation: Implementation and Evaluation

by Tito Autrey , 1994
"... We have developed a hybrid algorithm for interprocedural constant propagation combining two prior methods with a new demand-driven approach. We modified a prior intraprocedural constant propagator to use incrementally in a demand-driven 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 demand-driven approach. We modified a prior intraprocedural constant propagator to use incrementally in a demand-driven interprocedural framework. We compare our algorithm to three

Interprocedural Constant Propagation: A Study of Jump Function Implementations

by Dan Grove , Linda Torczon - 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 49 (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 Data-Flow Model

by David Binkley - 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 control-flow and data-flow information from a program. The optimization of (interprocedural) constant propagation is studied. The algorithm developed combines a program dependence graph called the system

Interprocedural dataflow analysis via graph reachability

by Thomas Reps, Susan Horwitz, Mooly Sagiv , 1994
"... The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in poly-nomial time by transforming them into a special kind of graph-reachability 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 non-separable problems, including truly-live variables, copy constant pro-pagation, and possibly-uninitialized variables. Results are reported from a preliminary experimental study of C programs (for the problem of finding possibly

Constant propagation with conditional branches

by Mark N. Wegman, F. Kenneth Zadeck - ACM Transactions on Programming Languages and Systems , 1991
"... Constant propagation is a well-known 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 355 (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.

Shape modeling with front propagation: A level set approach

by Ravikanth Malladi, James A. Sethian, Baba C. Vemuri - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1995
"... Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and over- ..."
Abstract - Cited by 808 (20 self) - Add to MetaCart
than one object of interest, has the ability to split freely to represent each object. This method is based on the ideas developed by Osher and Sethian to model propagating solidhiquid interfaces with curvature-dependent speeds. The interface (front) is a closed, nonintersecting, hypersurface flowing

House Prices, Borrowing Constraints, and Monetary Policy in the Business Cycle

by Matteo Iacoviello , 2002
"... I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asse ..."
Abstract - Cited by 512 (10 self) - Add to MetaCart
asset and nominal prices in the same direction, and are amplified and propagated over time. The “financial accelerator ” is not constant across shocks: nominal debt stabilises supply shocks, making the economy less volatile when the central bank controls the interest rate. I discuss the role of equity
Next 10 →
Results 1 - 10 of 3,890
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University