Results 1  10
of
239
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
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
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
space complete for P. These results provide evidence that there do not exist fast (NCclass) parallel algorithms for interprocedural slicing and precise interprocedural dataflowanalysis (unless P = NC). That is, it is unlikely that there are algorithms for interprocedural slicing and precise interprocedural
Precise Interprocedural Dataflow Analysis via Graph Reachability
"... 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 func ..."
Abstract
 Add to MetaCart
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
Precise Interprocedural Dataflow Analysis via Graph Reachability
"... 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 func ..."
Abstract
 Add to MetaCart
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
Precise Interprocedural Dataflow Analysis via Graph Reachability
"... 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 func ..."
Abstract
 Add to MetaCart
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
Precise Interprocedural Dataflow Analysis via Graph Reachability
, 1995
"... 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 func ..."
Abstract
 Add to MetaCart
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
Interprocedural MayAlias Analysis for Pointers: Beyond klimiting
, 1994
"... Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: klimiting, which blurs distinction between subobjects below depth k; and storebased (or equivalently location or regionbased) approximations, which blur distinction between elements ..."
Abstract

Cited by 249 (0 self)
 Add to MetaCart
elements of recursive data structures. Although notable progress in interprocedural alias analysis has been recently accomplished, very little progress in the precision of analysis of recursive pointer data structures has been seen since the inception of these approximation techniques by Jones and Muchnick
Efficient FlowSensitive Interprocedural Computation of PointerInduced Aliases and Side Effects
, 1993
"... We present practical approximation methods for computing interprocedural aliases and side effects for a program written in a language that includes pointers, reference parameters and recursion. We present the following results: 1) An algorithm for flowsensitive interprocedural alias analysis which ..."
Abstract

Cited by 231 (11 self)
 Add to MetaCart
is more precise and efficient than the best interprocedural method known. 2) An extension of traditional flowinsensitive alias analysis which accommodates pointers and provides a framework for a family of algorithms which trade off precision for efficiency. 3) An algorithm which correctly computes side
Precise interprocedural chopping
, 1995
"... The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many softwareengineering problems, including program understanding, debugging, maintenance, testing, and merging. A slice determines either all program elements that might affect a given e ..."
Abstract

Cited by 69 (7 self)
 Add to MetaCart
that serve to transmit effects from a given source element s to a given target element t?” However, Jackson and Rollins define only a limited form of chopping: Among other restrictions, they impose the restriction that s and t be in the same procedure. This paper solves the unrestricted interprocedural
Weighted pushdown systems and their application to interprocedural dataflow analysis
 Sci. of Comp. Prog
, 2003
"... Abstract. Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meetoverallpaths value (for paths that meet a certain criterion). This paper shows how weighted PDSs yield new algorithms for certain ..."
Abstract

Cited by 140 (31 self)
 Add to MetaCart
classes of interprocedural dataflowanalysis problems. 1
Results 1  10
of
239