• Publications
  • Influence
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
TLDR
We present an incremental algorithm for a version of the dynamic grammar problem that handles multiple heterogeneous changes. Expand
  • 394
  • 38
  • PDF
On the Computational Complexity of Dynamic Graph Problems
TLDR
This paper explores a different way to analyze incremental algorithms. Expand
  • 247
  • 37
  • PDF
Effective typestate verification in the presence of aliasing
TLDR
This paper addresses the challenge of sound typestate verification, with acceptable precision, for real-world Java programs. Expand
  • 246
  • 25
  • PDF
Context-sensitive synchronization-sensitive analysis is undecidable
TLDR
We show that an analysis that is simultaneously both context-sensitive and synchronization-sensitive (that is, a context- sensitive analysis that precisely takes into account the constraints on execution order imposed by the synchronization statements in the program) is impossible even for the simplest of analysis problems. Expand
  • 279
  • 18
  • PDF
Aggregate structure identification and its application to program analysis
TLDR
In this paper, we describe an efficient algorithm for lazily decomposing aggregates such as records and arrays into simpler components based on access patterns specific to a given program. Expand
  • 126
  • 11
  • PDF
The undecidability of aliasing
TLDR
Alias analysis is a prerequisite for performing most of the common program analyses such as reaching-definitions analysis or live-variables analysis. Expand
  • 298
  • 9
  • PDF
A categorized bibliography on incremental computation
TLDR
In many kinds of emnputatiomd contexts, modifications of the input data are to be processed at once so as to have immediate effect on the output. Expand
  • 169
  • 9
  • PDF
Parametric program slicing
TLDR
Program slicing is a technique for isolating computational threads in programs. Expand
  • 123
  • 9
  • PDF
Bounded Incremental Computation
  • G. Ramalingam
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1996
TLDR
Incremental computation concerns the re-computation of output after a change in input. Expand
  • 102
  • 8
Safe programmable speculative parallelism
TLDR
Speculation by programmers as an algorithmic paradigm to parallelize seemingly sequential code, without the overhead required for rollbacks. Expand
  • 66
  • 8
  • PDF