Abstract is missing.
- Program Analysis for Implicit Computational ComplexityNeil D. Jones. 1 [doi]
- Deriving Pre-conditions for Array Bound Check EliminationWei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu. 2-24 [doi]
- Type Systems for Useless-Variable EliminationAdam Fischbach, John Hannan. 25-38 [doi]
- Boolean Constraints for Binding-Time AnalysisKevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard. 39-62 [doi]
- Constraint AbstractionsJörgen Gustavsson, Josef Svenningsson. 63-83 [doi]
- Implementing Circularity Using Partial EvaluationJulia L. Lawall. 84-102 [doi]
- Combining Forward and Backward Analyses of Temporal PropertiesDamien Massé. 103-116 [doi]
- Numerical Power AnalysisIsabella Mastroeni. 117-137 [doi]
- Run-Time Bytecode SpecializationHidehiko Masuhara, Akinori Yonezawa. 138-154 [doi]
- A New Numerical Abstract Domain Based on Difference-Bound MatricesAntoine Miné. 155-172 [doi]
- Partial Evaluation for Class-Based Object-Oriented LanguagesUlrik Pagh Schultz. 173-197 [doi]
- Driving in the JungleJens P. Secher. 198-217 [doi]
- Higher-Order Pattern Matching for Automatically Applying Fusion TransformationsGanesh Sittampalam, Oege de Moor. 218-237 [doi]
- Dynamic Partial EvaluationGregory T. Sullivan. 238-256 [doi]
- Tag Elimination and Jones-OptimalityWalid Taha, Henning Makholm, John Hughes. 257-275 [doi]
- Bottom-Up Deduction with Deletion and PrioritiesHarald Ganzinger. 276-278 [doi]