Results 1  10
of
48
The Interprocedural Coincidence Theorem
 In Int. Conf. on Comp. Construct
, 1992
"... We present an interprocedural generalization of the wellknown (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a sufficient condition for the equivalence of the meet over all paths (MOP ) solution and the maximal fixed point (MFP ) solution to a data flow analysis problem. Th ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
We present an interprocedural generalization of the wellknown (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a sufficient condition for the equivalence of the meet over all paths (MOP ) solution and the maximal fixed point (MFP ) solution to a data flow analysis problem
On the Sequential Nature of Interprocedural ProgramAnalysis Problems
, 1995
"... In this paper,westudy twointerprocedural programanalysis problemsinterprocedural slicing and interprocedural dataflowanalysisand present the following results: .Interprocedural slicing is logspace complete for P. .The problem of obtaining "meetoverallvalidpaths" solutions to i ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
to interprocedural versions of distributive dataflowanalysis problems is Phard. .Obtaining "meetoverallvalidpaths" solutions to interprocedural versions of distributive dataflowanalysis problems that involvefinite sets of dataflowfacts (such as the classical "gen/kill" problems) is log
Solving demand versions of interprocedural analysis problems
 in Proceedings of the Fifth International Conference on Compiler Construction
"... This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a programanalysis problem, some piece of summary information (e.g., the dataflow facts holding at a given point) is to be reported only for a single program element of interest (or a sma ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a programanalysis problem, some piece of summary information (e.g., the dataflow facts holding at a given point) is to be reported only for a single program element of interest (or a
Interprocedural Compilation of Fortran D
, 1996
"... Fortran D is a version of Fortran extended with data decomposition specifications. It is designed to provide a machineindependent programming model for dataparallel applications and has heavily influenced the design of High Performance Fortran (HPF). In previous work we described Fortran D compila ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Fortran D is a version of Fortran extended with data decomposition specifications. It is designed to provide a machineindependent programming model for dataparallel applications and has heavily influenced the design of High Performance Fortran (HPF). In previous work we described Fortran D
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
and Zadeck solve the intraprocedural constant propagation problem with an optimistic algorithm [WZ91]. Their algorithm solves the sparse conditional constant problem. The interprocedural version of their algorithm links the Static Single Assignment graphs of all procedures together and runs
Interprocedural Heap Analysis for Parallelizing Imperative Programs
 Programming Models For Massively Parallel Computers
, 1993
"... The parallelization of imperative programs working on pointer data structures is possible by using extensive heap analysis. Therefore we consider a new interprocedural version of the heap analysis algorithm with summary nodes from Chase, Wegman, and Zadeck. Our analysis handles arbitrary call graphs ..."
Abstract
 Add to MetaCart
The parallelization of imperative programs working on pointer data structures is possible by using extensive heap analysis. Therefore we consider a new interprocedural version of the heap analysis algorithm with summary nodes from Chase, Wegman, and Zadeck. Our analysis handles arbitrary call
Demand Interprocedural Program Analysis Using Logic Databases
, 1994
"... This paper describes how algorithms for demand versions of inerprocedural programanalysis problems can be obtained from their exhaustive counterparts essentially for free, by applying the socalled magicsets transformation that was developed in the logicprogramming and deductivedatabase communiti ..."
Abstract

Cited by 54 (8 self)
 Add to MetaCart
associated with the elements of a program (such as reaching definitions, available expressions, live variables, etc.). Most treatments of interprocedural analysis address the exhaustive version of the problem: summary information is to be reported for all elements of the program. This paper concerns
Abstract 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 programanalysis problem, some piece of summary information (e.g., the dataflow facts holding at a given point) is to be reported only for a single program element of interest (or a sma ..."
Abstract
 Add to MetaCart
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a programanalysis problem, some piece of summary information (e.g., the dataflow facts holding at a given point) is to be reported only for a single program element of interest (or a
Frameworks for intra and interprocedural dataflow analysis
, 1996
"... Because dataflow analyses are difficult to implement from scratch, reusable dataflow analysis frameworks have been developed which provide generic support facilities for managing propagation of dataflow information and iteration in loops. We have designed a framework that improves on previous work b ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
by making it easy to perform graph transformations as part of iterative analysis, to run multiple analyses “in parallel ” to achieve the precision of a single monolithic analysis while preserving modularity and reusability of the component analyses, and to construct contextsensitive interprocedural
Modular Lattices for Compositional Interprocedural Analysis
"... Interprocedural analyses are compositional when they compute overapproximations of procedures in a bottomup fashion. These analyses are usually more scalable than topdown analyses which compute a different procedure summary for every calling context. However, compositional analyses are rare in pr ..."
Abstract
 Add to MetaCart
Interprocedural analyses are compositional when they compute overapproximations of procedures in a bottomup fashion. These analyses are usually more scalable than topdown analyses which compute a different procedure summary for every calling context. However, compositional analyses are rare
Results 1  10
of
48