Static Analysis

Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refinement . . . . . . . . . . . . . . . . . . . . . . . . . 85 Patricia Hill, Fausto Spoto Binary Decision Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 Laurent Mauborgne Binding-Time Analysis for Both Static and Dynamic Expressions . . . . . . . . 117 Kenichi Asai

[1]  Daniel Le Métayer,et al.  Compile-time garbage collection by sharing analysis , 1989, FPCA.

[2]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  Michael Sperber.  Self-Applicable Online Partial Evaluation , 1996, Dagstuhl Seminar on Partial Evaluation.

[4]  Thomas Reps,et al.  Interconveritibility of Set Constraints and Context-Free Language Reachability , 1997, PEPM.

[5]  Mitchell Wand,et al.  Constraint systems for useless variable elimination , 1999, POPL '99.

[6]  Paul N. Hilfinger,et al.  Analysis of recursive types in Lisp-like languages , 1992, LFP '92.

[7]  Yanhong A. Liu,et al.  Systematic Derivation of Incremental Programs , 1995, Sci. Comput. Program..

[8]  Erik Ruf.  Topics in online partial evaluation , 1993 .

[9]  Philip Wadler,et al.  Projections for strictness analysis , 1987, FPCA.

[10]  Nobuhisa Fujinami,et al.  Determination of Dynamic Method Dispatches Using Run-Time Code Generation , 1998, Types in Compilation.

[11]  Yanhong A. Liu,et al.  Dynamic Programming via Static Incrementalization , 1999, High. Order Symb. Comput..

[12]  Frank Tip,et al.  A study of dead data members in C++ applications , 1998, PLDI.

[13]  Yanhong A. Liu,et al.  Static caching for incremental computation , 1998, TOPL.

[14]  John Launchbury.  Projection factorisations in partial evaluation , 1989 .

[15]  Thomas W. Reps,et al.  Interconvertibility of a class of set constraints and context-free-language reachability , 2000, Theor. Comput. Sci..

[16]  J. Jørgensen,et al.  Efficient Analyses for Realistic Off-Line Partial Evaluation : Extended Version , 1993 .

[17]  Dana S. Scott,et al.  Lectures on a Mathematical Theory of Computation , 1982 .

[18]  Robin Milner,et al.  Definition of standard ML , 1990 .

[19]  Hidehiko Masuhara,et al.  Partial Evaluation of Call-by-Value lambda-Calculus with Side-Effects , 1997, PEPM.

[20]  Maged M. Michael,et al.  Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors , 1998, J. Parallel Distributed Comput..

[21]  Yanhong A. Liu,et al.  Dependence analysis for recursive data , 1998, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225).

[22]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[23]  Paul F. Syverson.  Adding time to a logic of authentication , 1993, CCS '93.

[24]  Robert Glück,et al.  An Automatic Program Generator for Multi-Level Specialization , 1997, LISP Symb. Comput..

[25]  Fritz Henglein.  Efficient Type Inference for Higher-Order Binding-Time Analysis , 1991, FPCA.

[26]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[27]  Anders Bondorf,et al.  Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types , 1991, Sci. Comput. Program..

[28]  Benjamin Goldberg,et al.  Escape analysis on lists , 1992, PLDI '92.

[29]  Mitchell Wand,et al.  Set constraints for destructive array update optimization , 1998, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225).

[30]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[31]  Olivier Danvy.  Type-Directed Partial Evaluation , 1998, Partial Evaluation.

[32]  John Launchbury,et al.  Strictness and binding-time analyses: two for the price of one , 1991, PLDI '91.

[33]  Olivier Danvy,et al.  Abstracting control , 1990, LISP and Functional Programming.

[34]  Yanhong A. Liu,et al.  Discovering auxiliary information for incremental computation , 1996, POPL '96.

[35]  Neil D. Jones,et al.  Program flow analysis - theory and applications , 1981, Prentice Hall software series.

[36]  David Grove,et al.  Identifying Profitable Specialization in Object-Oriented Languages , 1994, PEPM.

[37]  William Pugh,et al.  Iteration space slicing and its application to communication optimization , 1997, ICS '97.

[38]  Cliff B. Jones,et al.  Specification and Design of (Parallel) Programs , 1983, IFIP Congress.

[39]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1988, Theoretical Computer Science.

[40]  Thomas W. Reps,et al.  Program Specialization via Program Slicing , 1996, Dagstuhl Seminar on Partial Evaluation.

[41]  Reinhard Wilhelm,et al.  Solving shape-analysis problems in languages with destructive updating , 1998, TOPL.

[42]  Prateek Mishra,et al.  Declaration-free type checking , 1985, POPL.

[43]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[44]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

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

[46]  Charles Consel,et al.  Fixpoint computation for polyvariant static analyses of higher-order applicative programs , 1994, TOPL.

[47]  Boleslaw K. Szymanski.  A simple solution to Lamport's concurrent programming problem with linear wait , 1988, ICS '88.

[48]  Torben Æ. Mogensen.  Separating binding times in language specifications , 1989, Conference on Functional Programming Languages and Computer Architecture.

[49]  Jacques Noyé,et al.  Effective Specialization of Realistic Programs via Use Sensitivity , 1997, SAS.

[50]  Jens Palsberg,et al.  The essence of eta-expansion in partial evaluation , 1994, LISP Symb. Comput..

[51]  Robert Paige,et al.  Finite Differencing of Computable Expressions , 1982, TOPL.

[52]  Olin Shivers,et al.  Control flow analysis in scheme , 1988, PLDI '88.

[53]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[54]  Yoshihiko Futamura,et al.  Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler , 1999, High. Order Symb. Comput..

[55]  Helmut Seidl,et al.  Constraints to Stop Deforestation , 1998, Sci. Comput. Program..

[56]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

[57]  Morten Heine Sørensen,et al.  Grammar-Based Data-Flow Analysis to Stop Deforestation , 1994, CAAP.

[58]  Cliff B. Jones,et al.  Tentative steps toward a development method for interfering programs , 1983, TOPL.

[59]  KEN KENNEDY,et al.  Use-Definition Chains with Applications , 1978, Comput. Lang..

[60]  Bernhard Steffen,et al.  Partial dead code elimination , 1994, PLDI '94.