Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Interprocedural slicing using dependence graphs

- Susan Horwitz, T. Reps, D. Binkley
- Computer Science
- SIGP
- 1 June 1988

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 of… Expand

Precise interprocedural dataflow analysis via graph reachability

- T. Reps, Susan Horwitz, S. Sagiv
- Computer Science
- POPL '95
- 25 January 1995

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. The… Expand

Parametric shape analysis via 3-valued logic

- S. Sagiv, T. Reps, R. Wilhelm
- Computer Science
- POPL '99
- 1999

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 main… Expand

Interprocedural slicing using dependence graphs

- Susan Horwitz, T. Reps, D. Binkley
- Computer Science
- TOPL
- 3 January 1990

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 taken… Expand

Analyzing Memory Accesses in x86 Executables

- G. Balakrishnan, T. Reps
- Computer Science
- CC
- 29 March 2004

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 a… Expand

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

- G. Ramalingam, T. Reps
- Mathematics, Computer Science
- J. Algorithms
- 1 September 1996

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 a… Expand

On the Computational Complexity of Dynamic Graph Problems

- G. Ramalingam, T. Reps
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 20 May 1996

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

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 to… Expand

Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation

- S. Sagiv, T. Reps, Susan Horwitz
- Computer Science
- TAPSOFT
- 22 May 1995

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 the… Expand

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis

- T. Reps, Stefan Schwoon, S. Jha
- Computer Science
- SAS
- 11 June 2003

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 that… Expand