• Publications
  • Influence
Interprocedural slicing using dependence graphs
A slice of a program with respect to a program point p and variable x consists of all statements of the program that might affect the value of x at point p. This paper concerns the problem ofExpand
  • 783
  • 140
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
  • 996
  • 112
  • Open Access
Parametric shape analysis via 3-valued logic
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The mainExpand
  • 1,035
  • 86
  • Open Access
Interprocedural slicing using dependence graphs
The notion of a <italic>program slice</italic>, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is takenExpand
  • 1,163
  • 69
  • Open Access
Analyzing Memory Accesses in x86 Executables
This paper concerns static-analysis algorithms for analyzing x86 executables. The aim of the work is to recover intermediate representations that are similar to those that can be created for aExpand
  • 369
  • 60
  • Open Access
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Thegrammar problem, a generalization of the single-source shortest-path problem introduced by D. E. Knuth (Inform. Process. Lett.6(1) (1977), 1?5) is to compute the minimum-cost derivation of aExpand
  • 383
  • 36
  • Open Access
On the Computational Complexity of Dynamic Graph Problems
Abstract A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input.Expand
  • 238
  • 36
  • Open Access
Program analysis via graph reachability
  • T. Reps
  • Computer Science
  • Inf. Softw. Technol.
  • 20 November 1997
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 toExpand
  • 325
  • 35
  • Open Access
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation
This paper concerns interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and theExpand
  • 125
  • 35
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis
Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-all-paths value (for paths thatExpand
  • 253
  • 33
  • Open Access