Program Analysis via Graph Reachability

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA332493

Entities

People

  • Thomas Reps

Organizations

  • University of Wisconsin Madison Department of Computer Science

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Context Free Grammars
  • Dynamic Programming
  • Engineering
  • Environment
  • Equations
  • Grammars
  • Hot Spots
  • Information Processing
  • Language
  • New York
  • Precision
  • Recognition
  • Sequences
  • Software Development
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.