Programs as data objects : second symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001 : proceedings

Invited Opening Talk.- Program Analysis for Implicit Computational Complexity.- Contributed Papers.- Deriving Pre-conditions for Array Bound Check Elimination.- Type Systems for Useless-Variable Elimination.- Boolean Constraints for Binding-Time Analysis.- Constraint Abstractions.- Implementing Circularity Using Partial Evaluation.- Combining Forward And Backward Analyses of Temporal Properties.- Numerical Power Analysis.- Run-Time Bytecode Specialization.- A New Numerical Abstract Domain Based on Difference-Bound Matrices.- Partial Evaluation for Class-Based Object-Oriented Languages.- Driving in the Jungle.- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations.- Dynamic Partial Evaluation.- Tag Elimination and Jones-Optimality.- Invited Closing Talk.- Bottom-Up Deduction with Deletion and Priorities.