Programs as Data Objects: Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the Second Symposium on Programs as Data Objects, PADO 2001, held in Aarhus, Denmark, in May 2001.
The 14 revised full papers presented were carefully reviewed and selected from 30 submissions. Various aspects of looking at programs as data objects are covered from the point of view of program analysis, program transformation, computational complexity, etc.

Author(s): Neil D. Jones (auth.), Olivier Danvy, Andrzej Filinski (eds.)
Series: Lecture Notes in Computer Science 2053
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 286
Tags: Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Software Engineering

Program Analysis for Implicit Computational Complexity....Pages 1-1
Deriving Pre-conditions for Array Bound Check Elimination....Pages 2-24
Type Systems for Useless-Variable Elimination....Pages 25-38
Boolean Constraints for Binding-Time Analysis....Pages 39-62
Constraint Abstractions....Pages 63-83
Implementing Circularity Using Partial Evaluation....Pages 84-102
Combining Forward And Backward Analyses of Temporal Properties....Pages 103-116
Numerical Power Analysis....Pages 117-137
Run-Time Bytecode Specialization....Pages 138-154
A New Numerical Abstract Domain Based on Difference-Bound Matrices....Pages 155-172
Partial Evaluation for Class-Based Object-Oriented Languages....Pages 173-197
Driving in the Jungle....Pages 198-217
Higher-Order Pattern Matching for Automatically Applying Fusion Transformations....Pages 218-237
Dynamic Partial Evaluation....Pages 238-256
Tag Elimination and Jones-Optimality....Pages 257-275
Bottom-Up Deduction with Deletion and Priorities....Pages 276-277