• Publications
  • Influence
Precise interprocedural dataflow analysis via graph reachability
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. TheExpand
Interprocedural slicing using dependence graphs
TLDR
A new kind of graph to represent programs is introduced, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Expand
Interprocedural slicing using dependence graphs
TLDR
A new kind of graph to represent programs is introduced, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Expand
Parametric shape analysis via 3-valued logic
TLDR
A family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage by varying the vocabulary used in the three-valued logic. Expand
Analyzing Memory Accesses in x86 Executables
TLDR
The aim of the work is to recover intermediate representations that are similar to those that can be created for a program written in a high-level language by static-analysis algorithms for analyzing x86 executables. Expand
Program analysis via graph reachability
  • T. Reps
  • Computer Science
  • Inf. Softw. Technol.
  • 20 November 1997
TLDR
How a number of program-analysis problems can be solved by transforming them to graph-reachability problems is described, and relationships between graph reachability and other approaches to program analysis are described. Expand
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
TLDR
An efficient incremental algorithm for the single-source shortest-path problem with positive edge lengths is obtained and is able to handle “multiple heterogeneous modifications”: between updates, the input graph is allowed to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edge-length changes. Expand
On the Computational Complexity of Dynamic Graph Problems
TLDR
Rather than express the cost of an incremental computation as a function of the size of the current input, the cost is measured in terms of the sum of the sizes of the changes in the input and the output to develop a more informative theory of computational complexity for dynamic problems. Expand
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis
TLDR
This paper shows how weighted PDSs yield new algorithms for certain classes of interprocedural dataflow-analysis problems. Expand
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation
TLDR
An efficient dynamic-programming algorithm is presented that produces precise solutions to interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment and the effect of a program operation is representation by a distributive environment transformer. Expand
...
1
2
3
4
5
...