Graph Rewrite Systems For Program Optimization

[1]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[2]  Etienne Morel,et al.  Global optimization by suppression of partial redundancies , 1979, CACM.

[3]  M. Nagl.  Graph-Grammatiken: Theorie, Anwendungen, Implementierung , 1979 .

[4]  Robert E. Tarjan,et al.  A Unified Approach to Path Problems , 1981, JACM.

[5]  Matthias Jarke,et al.  Logic Programming and Databases , 1984, Expert Database Workshop.

[6]  Susan Horwitz,et al.  Generating editing environments based on relations and attributes , 1986, TOPL.

[7]  Gregor Snelting,et al.  The PSG system: from formal language definitions to interactive programming environments , 1986, TOPL.

[8]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[9]  Thomas Reps,et al.  The Synthesizer Generator: A System for Constructing Language-Based Editors , 1988 .

[10]  David Harel,et al.  On visual formalisms , 1988, CACM.

[11]  G. A. Venkatesh.  A framework for construction and evaluation of high-level specifications for program analysis techniques , 1989, PLDI '89.

[12]  S. Doaitse Swierstra,et al.  Higher order attribute grammars , 1989, PLDI '89.

[13]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  Mary Lou Soffa,et al.  Automatic generation of global optimizers , 1991, PLDI '91.

[15]  Andreas Schürr,et al.  Operationales Spezifizieren mit programmierten Graphersetzungssystemen , 1991 .

[16]  Steven W. K. Tjiang,et al.  Sharlit—a tool for building optimizers , 1992, PLDI '92.

[17]  Detlef Plump,et al.  Evaluation of functional expressions by hypergraph rewriting , 1993 .

[18]  Martin Odersky,et al.  Defining context-dependent syntax without using contexts , 1993, TOPL.

[19]  Zena M. Ariola,et al.  Graph rewriting systems for efficient compilation , 1993 .

[20]  Jeffrey D. Ullman,et al.  Assigning an Appropriate Meaning to Database Logic With Negation , 1994 .

[21]  Thomas W. Reps,et al.  Solving Demand Versions of Interprocedural Analysis Problems , 1994, CC.

[22]  Uwe Aßmann.  On Edge Addition Rewrite Systems and their Relevance to Program Analysis , 1994, TAGT.

[23]  Program optimization and parallelization using idioms , 1994, TOPL.

[24]  David W. Binkley,et al.  Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model , 1994, CC.

[25]  Detlef Plump,et al.  On Termination of Graph Rewriting , 1995, WG.

[26]  Thomas W. Reps,et al.  Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.

[27]  Martin Alt,et al.  Generation of Efficient Interprocedural Analyzers with PAG , 1995, SAS.

[28]  Uwe Aßmann.  OPTIMIX Language Manual (for OPTIMIX 2.0) , 1996 .

[29]  Uwe Aßmann,et al.  Generierung von Programmoptimierungen mit Graphersetzungssystemen , 1996 .

[30]  Jürgen Vollmer.  Modula-P A Language for Parallel Programming , 2002 .