Results 1 
5 of
5
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 116 (1 self)
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient incremental algorithm for the singlesource shortestpath problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortestpath problem is its ability 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 edgelength changes.
On the Computational Complexity of Dynamic Graph Problems
 THEORETICAL COMPUTER SCIENCE
, 1996
"... ..."
Interprocedural optimization: eliminating unnecessary recompilation
 ACM Transactions on Programming Languages and Systems
, 1993
"... While efficient new algorithms for interprocedural dataflow analysis have made these techniques practical for use in production compilation systems,a new problem has arisen: collecting and using interprocedural information in a compiler introduces subtle dependence among the proceduresof a program. ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
While efficient new algorithms for interprocedural dataflow analysis have made these techniques practical for use in production compilation systems,a new problem has arisen: collecting and using interprocedural information in a compiler introduces subtle dependence among the proceduresof a program. If the compiler dependson interprocedural information to optimize a given module, a subsequentediting changeto another module in the program may changethe interprocedural information and necessitaterecompilation. To avoid having to recompile every module in a program in responseto a single editing changeto one module, we have developed techniquesto more precisely determine which compilations have actually beeninvalidated by a changeto the programâ€™s source.This paper presents a general recoinpzlatton test to determine which proceduresmust be compiled in responseto a series of editing changes.Three different implementation strategies, which demonstrate the fundamental tradeoff between the cost of analysis and the precision of the resulting test, are also discussed.
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
 IN ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL
, 1994
"... We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and deletion of edges. Such an algorithm has applications in incremental dataflow analysis and incremental compilation. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and deletion of edges. Such an algorithm has applications in incremental dataflow analysis and incremental compilation.
An EliminationBased Approach to Incremental Data Flow Analysis
, 1995
"... In this paper we present a new approach for incremental data flow analysis based on elimination methods. Unlike previous eliminationbased incremental data flow analysis, our approach can handle arbitrary nonstructural and structural changes to program flowgraphs, including irreducibility. We use p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we present a new approach for incremental data flow analysis based on elimination methods. Unlike previous eliminationbased incremental data flow analysis, our approach can handle arbitrary nonstructural and structural changes to program flowgraphs, including irreducibility. We use properties of dominance frontiers and iterated dominance frontiers for updating data flow solutions. These properties are applicable to both reducible and irreducible flowgraphs. Since we use properties of dominance frontiers (and iterated dominance frontiers) we also give a simple algorithm for updating the dominance frontier relation. The dominance frontier update algorithm is based on our previous work for updating dominator trees. i Contents 1 Introduction 1 2 Exhaustive Elimination Method: An Overview 2 3 Our Approach 5 3.1 Initial and Final Flow Equations : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.2 Basic Steps : : : : : : : : : : : : : : : : : : : : : : : : : : : : :...