2. PADO 2001:
Aarhus, Denmark
Olivier Danvy, Andrzej Filinski (Eds.):
Programs as Data Objects, Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings.
Lecture Notes in Computer Science 2053 Springer 2001, ISBN 3-540-42068-1 
Invited Opening Talk
- Neil D. Jones:
Program Analysis for Implicit Computational Complexity.
1
Contributed Papers
- Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu:
Deriving Pre-conditions for Array Bound Check Elimination.
2-24
- Adam Fischbach, John Hannan:
Type Systems for Useless-Variable Elimination.
25-38
- Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard:
Boolean Constraints for Binding-Time Analysis.
39-62
- Jörgen Gustavsson, Josef Svenningsson:
Constraint Abstractions.
63-83
- Julia L. Lawall:
Implementing Circularity Using Partial Evaluation.
84-102
- Damien Massé:
Combining Forward and Backward Analyses of Temporal Properties.
103-116
- Isabella Mastroeni:
Numerical Power Analysis.
117-137
- Hidehiko Masuhara, Akinori Yonezawa:
Run-Time Bytecode Specialization.
138-154
- Antoine Miné:
A New Numerical Abstract Domain Based on Difference-Bound Matrices.
155-172
- Ulrik Pagh Schultz:
Partial Evaluation for Class-Based Object-Oriented Languages.
173-197
- Jens P. Secher:
Driving in the Jungle.
198-217
- Ganesh Sittampalam, Oege de Moor:
Higher-Order Pattern Matching for Automatically Applying Fusion Transformations.
218-237
- Gregory T. Sullivan:
Dynamic Partial Evaluation.
238-256
- Walid Taha, Henning Makholm, John Hughes:
Tag Elimination and Jones-Optimality.
257-275
Invited Closing Talk
Last update Tue May 21 17:49:42 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
