Skip to search formSkip to main contentSkip to account menu

Pointer analysis

Known as: Points-to analysis 
In computer science, pointer analysis, or points-to analysis, is a static code analysis technique that establishes which pointers, or heap references… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Atomic sections have been recently introduced as a language construct to improve the programmability of concurrent software. They… 
2004
2004
This paper presents a new, inexpensive, mechanism for constructing a complete call graph for Java programs at runtime, and… 
2003
2003
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of… 
2003
2003
This paper presents an efficient context-sensitive heap analysis algorithm called Data Structure Analysis designed to enable… 
2001
2001
With the advances in Computer Aided Design (CAD) technology, the design of digital circuits is becoming more and more as the… 
2001
2001
This thesis investigates the design and the correctness of a pointer analysis for the Java programming language. Although the… 
Highly Cited
1998
Highly Cited
1998
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding… 
1998
1998
Programs which manipulate pointers are hard to debug. Pointer analysis algorithms (originally aimed at optimizing compilers) may… 
Highly Cited
1998
Highly Cited
1998
As designers may model mixed software-hardware systems using a subset of C or C++, we present SpC, a solution to synthesize and… 
1980
1980
In this paper we propose an e cient and e ective algorithm to perform ow-insensitive interprocedural pointer analysis which can…