2001•Unpublished venueRequires access

Dynamic points-to sets

Markus U. Mock, Manuvir Das, Craig Chambers, Susan J. Eggers

Abstract

In this paper, we compare the behavior of pointers in C programs, as approximated by static pointer analysis algorithms, with the actual behavior of pointers when these programs are run. In order to perform this comparison, we have implemented several well known pointer analysis algorithms, and we have built an instrumentation infrastructure for tracking pointer values during program execution.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 70 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Pointer (user interface), Pointer analysis, Computer science, Programming language, Abstract interpretation, Static analysis, Program analysis, Parallel computing