ABSTRACT The subject of this paper is flow-and context-insensitive pointer analysis. We present a novel approach for precisely modelling struct variables and indirect function calls. Our method emphasises efficiency and simplicity and extends the language of set-constraints. We experimentally evaluate the precision cost trade-off using a benchmark suite of 7 common C programs between 5,000 to 150,000 lines of code. Our results indicate the field-sensitive analysis is more expensive to compute, but yields significantly better precision
One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is th...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
Interprocedural analysis requires a statically determinable call multigraph to represent the program...
We present a field-sensitive pointer analysis algorithm for C in the presence of type conversion bet...
This paper proposes an efficient technique for con~extsensitive pointer analysis that is applicable ...
The use of pointers creates serious problems for optimizing compilers and software engineering tools...
Real world programs (in languages like C) heavily make use of pointers. Program understanding activi...
This paper describes a new algorithm for ow and context insensitive pointer analysis of C programs....
Pointer analysis has recently been a subject of active research. The focus of most techniques is on:...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
Pointer analysis is an important part of source code anal ysis. Many programs that manipulate source...
The use of pointers presents serious problems for soft-ware productivity tools for software understa...
Many powerful code optimization techniques rely on accurate information connecting the definitions a...
Understanding large software systems is difficult. Traditionally, automated tools are used to assist...
Pointer analysis, a classic problem in software program analysis, has emerged as an important proble...
One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is th...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
Interprocedural analysis requires a statically determinable call multigraph to represent the program...
We present a field-sensitive pointer analysis algorithm for C in the presence of type conversion bet...
This paper proposes an efficient technique for con~extsensitive pointer analysis that is applicable ...
The use of pointers creates serious problems for optimizing compilers and software engineering tools...
Real world programs (in languages like C) heavily make use of pointers. Program understanding activi...
This paper describes a new algorithm for ow and context insensitive pointer analysis of C programs....
Pointer analysis has recently been a subject of active research. The focus of most techniques is on:...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
Pointer analysis is an important part of source code anal ysis. Many programs that manipulate source...
The use of pointers presents serious problems for soft-ware productivity tools for software understa...
Many powerful code optimization techniques rely on accurate information connecting the definitions a...
Understanding large software systems is difficult. Traditionally, automated tools are used to assist...
Pointer analysis, a classic problem in software program analysis, has emerged as an important proble...
One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is th...
We present a pointer analysis algorithm designed for source-to-source transformations. Existing tech...
Interprocedural analysis requires a statically determinable call multigraph to represent the program...