Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

SLP
1997

favoriteEmaildiscussreport

89views more SLP 1997»

Program Analysis via Graph Reachability

13 years 5 months ago

Program Analysis via Graph Reachability

Download www.cs.wisc.edu

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 dataﬂow-analysis problems, one version of the problem of approximating the possible “shapes” that heap-allocated structures in a program can take on, and ﬂow-insensitive points-to analysis. Relationships between graph reachability and other approaches to program analysis are described. Some techniques that go beyond pure graph reachability are also discussed.

Thomas W. Reps

Real-time Traffic

Certain Dataﬂow-analysis Problems | Graph Reachability | Program-analysis Problems | SLP 1997 |

claim paper

Related Content

» UserInput Dependence Analysis via Graph Reachability

» An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance

» Reachability Analysis in Verification via Supercompilation

» Detecting inconsistencies via universal reachability analysis

» The set constraintCFL reachability connection in practice

» Software model checking via largeblock encoding

» Static memory leak detection using fullsparse valueflow analysis

» Dynamic Cutoff Detection in Parameterized Concurrent Programs

» Verification and Synthesis of OCL Constraints Via Topology Analysis

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1997
Where	SLP
Authors	Thomas W. Reps

Comments (0)