Results 1  10
of
93,499
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 590 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
Pointsto Analysis by Type Inference of Programs with Structures and Unions
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis algorithm based on monomorphic type inference. The source language model the important features of C including pointers, pointer arithmetic, pointers to functions, structured objects, and unions. The algorithm is based on a nonstanda ..."
Abstract

Cited by 70 (0 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis algorithm based on monomorphic type inference. The source language model the important features of C including pointers, pointer arithmetic, pointers to functions, structured objects, and unions. The algorithm is based on a non
Pointsto Analysis by Type Inference of Programs with Structures and Unions
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis algorithm based on monomorphic type inference. The source language model the important features of C including pointers, pointer arithmetic, pointers to functions, structured objects, and unions. The algorithm is based on a nonsta ..."
Abstract
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis algorithm based on monomorphic type inference. The source language model the important features of C including pointers, pointer arithmetic, pointers to functions, structured objects, and unions. The algorithm is based on a non
Fast and Accurate FlowInsensitive PointsTo Analysis
 IN SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1997
"... In order to analyze a program that involves pointers, it is necessary to have (safe) information about what each pointer points to. There are many different approaches to computing pointsto information. This paper addresses techniques for flow and contextinsensitive interprocedural analysis of st ..."
Abstract

Cited by 162 (3 self)
 Add to MetaCart
In order to analyze a program that involves pointers, it is necessary to have (safe) information about what each pointer points to. There are many different approaches to computing pointsto information. This paper addresses techniques for flow and contextinsensitive interprocedural analysis
FlowInsensitive Interprocedural Alias Analysis in the Presence of Pointers
"... . Dataflow analysis algorithms can be classified into two categories: flowsensitive and flowinsensitive. To improve efficiency, flowinsensitive interprocedural analyses do not make use of the intraprocedural control flow information associated with individual procedures. Since pointerinduced al ..."
Abstract

Cited by 70 (17 self)
 Add to MetaCart
. Dataflow analysis algorithms can be classified into two categories: flowsensitive and flowinsensitive. To improve efficiency, flowinsensitive interprocedural analyses do not make use of the intraprocedural control flow information associated with individual procedures. Since pointer
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
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
Flow insensitive pointsto sets
 In Proceedings of the first IEEE Workshop on Source Code Analysis and Manipulation (Los Alamitos
, 2001
"... Pointer analysis is an important part of source code anal ysis. Many programs that manipulate source code take pointsto sets as part of their input. Pointsto related data collected from 27 midsized C programs (ranging in size from 1,168 to 87,579 lines of code) is presented. The data shows the re ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Pointer analysis is an important part of source code anal ysis. Many programs that manipulate source code take pointsto sets as part of their input. Pointsto related data collected from 27 midsized C programs (ranging in size from 1,168 to 87,579 lines of code) is presented. The data shows
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
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
Polymorphic versus monomorphic flowinsensitive pointsto analysis for C
 IN STATIC ANALYSIS SYMPOSIUM
, 2000
"... We carry out an experimental analysis for two of the design dimensions of flowinsensitive pointsto analysis for C: polymorphic versus monomorphic and equalitybased versus inclusionbased. Holding other analysis parameters fixed, we measure the precision of the four design points on a suite of be ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
We carry out an experimental analysis for two of the design dimensions of flowinsensitive pointsto analysis for C: polymorphic versus monomorphic and equalitybased versus inclusionbased. Holding other analysis parameters fixed, we measure the precision of the four design points on a suite
Results 1  10
of
93,499