Program Analysis via Graph Reachability

DMCA

Program Analysis via Graph Reachability (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Thomas Reps

Citations:

154 - 7 self

BibTeX

@MISC{Reps97programanalysis,
    author = {Thomas Reps},
    title = {Program Analysis via Graph Reachability},
    year = {1997}
}

OpenURL

Abstract

This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are amenable to this treatment include program slicing, certain dataflow-analysis problems, and the problem of approximating the possible "shapes" that heap-allocated structures in a program can take on. Relationships between graph reachability and other approaches to program analysis are described. Some techniques that go beyond pure graph reachability are also discussed.

Keyphrases

program analysis graph reachability program-analysis problem heap-allocated structure program slicing certain dataflow-analysis problem possible shape graph-reachability problem pure graph reachability

DMCA