"Sponsored by the Association for Computing Machinery, Special Interest Group on Programming Languages (SIGPLAN)."

This volume constitutes the proceedings of the second International Workshop on the Semantics, Applications, and Implementation of Program Generation (SAIG 2001)held on 6 September, 2001, in Florence, Italy. SAIG 2001 was held as an ACM SIGPLAN workshop co-located with the International Conference on Principles, Logics, and Implementations of High-level Programming Languages (PLI). As the commercial production of software systems moves toward being a traditional industry, automation will necessarily play a more substantial role in this industry, just as it plays a key role in the production of traditional commodities. SAIG aims at promoting the development and the application of foundational techniques for supporting automatic program generation. A key goal of SAIG is to provide a unique forum for both theoreticians and practitioners to present their results and ideas to an audience from a diverse background. This year we are fortunate to have three in?uential invited speakers: Krzysztof Czarnecki (DaimlerChrysler), Tim Sheard (OGI School of Science and Engineering), and Mitchell Wand (Northeastern University). The proceedings include abstracts of the invited talks, and an invited paper by Tim Sheard. Seven technical papers and two position papers were presented at SAIG 2001.

This volume contains the proceedings of the ninth international workshop on logic-based program synthesis and transformation (LOPSTR’99) which was held in Venice (Italy), September 22-24, 1999. LOPSTRistheannualworkshopandforumforresearchersinthelogic-based program development stream of computational logic. The main focus used to be on synthesis and transformation of logic programs, but the workshop is open to contributions on logic-based program development in any paradigm. Previous workshops were held in Manchester, UK (1991, 1992), Louvain-la-Neuve, B- gium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), and Manchester, UK (1998). LOPSTR is a real workshop in the sense that it is a friendly and lively forum for presenting recent and current research as well as discussing future trends. Formal proceedings of the workshop are produced only after the workshop and contain only those papers selected by the program committee after a second refereeing process. The program committee of LOPSTR’99 accepted 20 extended abstracts for presentation at the workshop; then selected 14 papers for inclusion in the po- workshop proceedings. Selected papers cover all the main streams of LOPSTR’s topics: synthesis, specialization, transformation, analysis, and veri?cation. Ve- ?cation, transformation, and specialization methods are applied to functional, constraint, logic, and imperative programming.

The functional logic programming paradigm combines the two most important fields of declarative programming, namely functional and logic programming, in an integrated way to allow the concise notation of high-level programs. However, the variety of concepts and conciseness of programs may also impact their efficiency. In this work we employ the powerful optimization technique of partial evaluation to develop a fully automatic program optimizer, the so-called partial evaluator. In particular, we formalize the normalization of programs during compilation, establish a formal notation of the evaluation process, develop a formal partial evaluation scheme and prove its correctness and termination, and implement a working partial evaluator which shows impressive results.

This book constitutes the thoroughly refereed post-proceedings of the International Seminar on Generic Programming held in Dagstuhl Castle, Germany in April/May 1998.The 20 revised full papers were carefully reviewed for inclusion in the book. As the first book entirely devoted to the new paradigm of generic programming, this collection offers topical sections on foundations and methodology comparisons, programming methodology, language design, and applications.

This is the second time that of ESOP has formed part of the ETAPS cluster of conferences, workshops, working group meetings and other associated activities. One of the results of colocatingso many conferences is a reduction in the number of possibilities to submit a paper to a European conference and the increased competition between conferences that occurs when boundaries between indiv- ual conferences have not yet become well established. This may have been the reason for the fact that only 44 submission were received this year. On the other hand we feel that the average quality of submissions has gone up, and thus the program committee was able to select 18 good papers, only one less than the year before. The program committee did not meet physically, and all discussion was done usinga Web-driven data base system. Despite some mixed feelings there is an overall tendency to appreciate the extra time available for giving papers a s- ond look and really going into comments made by other program committee members. I want to thank my fellow program committee members for the work they have put into the refereeingprocess and the valuable feedback they have given to authors. I want to thank the referees for their work and many detailed comments, and ?nally I want to thank everyone who has submitted a paper: without authors, no conference.

This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science.

The SPIN workshop is a forum for researchers interested in the subject of automata-based, explicit-state model checking technologies for the analysis and veri?cation of asynchronous concurrent and distributed systems. The SPIN - del checker (http://netlib.bell-labs.com/netlib/spin/whatispin.html), developed by Gerard Holzmann, is one of the best known systems of this kind, and has attracted a large user community. This can likely be attributed to its e?cient state exploration algorithms. The fact that SPIN’s modeling language, Promela, resembles a programming language has probably also contributed to its success. Traditionally, the SPIN workshops present papers on extensions and uses of SPIN. As an experiment, this year’s workshop was broadened to have a slightly wider focus than previous workshops in that papers on software veri?cation were encouraged. Consequently, a small collection of papers describe attempts to analyze and verify programs written in conventional programming languages. Solutions include translations from source code to Promela, as well as specially designed model checkers that accept source code. We believe that this is an - teresting research direction for the formal methods community, and that it will result in a new set of challenges and solutions. Of course, abstraction becomes the key solution to deal with very large state spaces. However, we also see - tential for integrating model checking with techniques such as static program analysis and testing. Papers on these issues have therefore been included in the proceedings.

As the complexity of software increases, researchers and practicioners continue to seek better techniques for engineering the construction of evolution of software. Partial evaluation is an attractive technology for modern software construction since it provides automatic tools for software specialization and is based on rigorous semantic foundations. This book is based on a school held at DIKU Copenhagen, Denmark in summer 1998 during which leading researchers summarized the state of the art in partial evaluation. The lectures presented survey the foundations of partial evaluation in a clear and rigorous manner and practically introduce several existing partial evaluators with numerous examples. The second part of the book is devoted to more sophisticated theoretical aspects, advances systems and applications, and highlights open problems and challenges. The book is ideally suited for advanced courses and for self study.