Programs as Data Objects

Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings

296 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik
• ISBN: 9783540420682
• Sprache: Englisch
• Erscheinungsdatum: 25.04.2001
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Andrzej Filinski, Olivier Danvy