Proceedings of the Workshop

1. Constructing Programs From Metasystem Transition Proofs

• G.W. Hamilton, School of Computing Dublin City University

• M.H. Kabir, School of Computing Dublin City University

2. Interpretive Overhead and Optimal Specialisation. Or: Life without the Pending List (Workshop Version)

• Lars Hartmann, DIKU (Computer Science Dept., University of Copenhagen, Denmark)

• Neil D. Jones, DIKU (Computer Science Dept., University of Copenhagen, Denmark)

• Jakob Grue Simonsen, DIKU (Computer Science Dept., University of Copenhagen, Denmark)

3. The Language FLAC: Computational Model and Modularity

• Victor L. Kistlerov, Institute of Information Transmission Problems Russian Academy of Sciences

4. An approach to Supercompilation for Object-oriented Languages: the Java Supercompiler Case Study

• Andrei V. Klimov, Keldysh Institute of Applied Mathematics Russian Academy of Sciences

5. A Program Specialization Relation Based on Supercompilation and its Properties

• Andrei V. Klimov, Keldysh Institute of Applied Mathematics Russian Academy of Sciences

6. An Approach to Polyvariant Binding Time Analysis for a Stack-Based Language

• Yuri A. Klimov, Keldysh Institute of Applied Mathematics, Russian Academy of Sciences

7. XSG: Fair Language with Built-in Equality

• Yuri A. Klimov, Keldysh Institute of Applied Mathematics, Russian Academy of Sciences

• Anton Yu. Orlov, Program Systems Institute, Russian Academy of Sciences

8. Verification as Specialization of Interpreters with Respect to Data

• Alexei P. Lisitsa, Department of Computer Science, The University of Liverpool

• Andrei P. Nemytykh, Program Systems Institute of Russian Academy of Sciences

9. Supercompilation for Equivalence Testing in Metamorphic Computer Viruses Detection

• Alexei P. Lisitsa, Department of Computer Science, The University of Liverpool

• Matt Webster, Department of Computer Science, The University of Liverpool

10. An Experience with Term Rewriting for Program Verification

• Sergei Mechveliani, Program Systems Institute, Pereslavl-Zalessky, Russia

11. On the Place of Supercompilation inside Program Specialization

• Andrei P. Nemytykh, Program Systems Institute of Russian Academy of Sciences

12. Higher-Order Functions as a Substitute for Partial Evaluation (A Tutorial)

• Sergei A. Romanenko, Keldysh Institute of Applied Mathematics Russian Academy of Sciences

13. Data Abstraction in a Language of Multilevel Computations Based on Pattern Matching

• Igor B. Shchenkov, Keldysh Institute of Applied Mathematics Russian Academy of Sciences