Michael Mislove Research Articles

Committees and Sponsors

This volume contains the Proceedings of SEGRAGRA'95, the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation. The Workshop was held in the “Centro Studi Santa Maria Maddalena” of Volterra, near Pisa, Italy, from August 28 to September 1, 1995.SEGRAGRA'95 addressed the area of Graph Rewriting and Term Graph Rewriting. It was the final workshop of two Esprit Basic Research Working Groups, COMPUGRAPH II and SEMAGRAPH II. Both working groups have been active in the three year period 1992/95. Unicode entity – undefined95. They have decided to organize their final workshop as a common initiative, with the aim of presenting the achieved results and their view of the state of the art in the field.Out of 39 submitted papers, the Program Committee selected 23 for presentation at the Workshop. These were grouped into sessions on Graph Rewriting I and II, Term Graph Rewriting I and II, Computing on Graphs, Concurrency & Parallelism, Modules, Software Engineering, Types and Proofs. The program included also invited talks by Eike Best (Universität Hildesheim), Thomas Johnsson (Chalmers University), Detlef Seese (Universität Karlsruhe) and Chris Wadsworth (Rutherford Appleton Laboratory); and tutorials by Henk Barendregt (Katholieke Universiteit Nijmegen), Andrea Corradini (Università di Pisa), Bruno Courcelle (Université Bordeaux I), Hartmut Ehrig (Technische Universität Berlin), Richard Kennaway (University of East Anglia, Norwich), Hans-Jörg Kreowski (Universität Bremen), Rinus Plasmeijer (Katholieke Universiteit Nijmegen) and Ronan Sleep (University of East Anglia, Norwich).The Conference site was made available at no cost to SEGRAGRA'95 by the Cassa di Risparmio di Volterra. The Workshop was supported by Gruppo Nazionale Informatica Matematica (CNR) and Istituto di Elaborazione dell'Informazione (CNR).We thank the anonymous referees, the Program Committee members: the Organizing Committee members: Fabio Gadducci and Marco Pistore from the University of Pisa gave us a valuable help in the local organization during the Workshop. We also thank the Managing Editors of the Electronic Notes in Computer Science series, Michael Mislove, Maurice Nivat, and Christos Papadimitriou, for giving us the opportunity of publishing the proceedings in this new electronic series, and Mike Mislove and Joost W.M. Kok (from Elsevier) for the constant support and the valuable suggestions they provided us during the preparation of this electronic volume.Andrea Corradini and Ugo Montanari, Guest Editors

Preface: Volume 86, Issue 3

This volume contains selected papers presented at the International Workshop on Functional and (Constraint) Logic Programming (WFLP 2003), held in Valencia (Spain) during June 12-13, 2003, at the Federated Conference on Rewriting, Deduction and Programming (RDP 2003). WFLP 2003 is the twelfth in the series of international meetings aimed at bringing together researchers interested in functional programming, (constraint) logic programming, as well as their integration. It promotes the cross-fertilizing exchange of ideas and experiences among researches and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. Previous WFLP editions have been held in Grado (Italy), Kiel (Germany), Benicàssim (Spain), Grenoble (France), Bad Honef (Germany), Schwarzenberg (Germany), Marburg (Germany), Rattenberg (Germany), and Karlsruhe (Germany).The Program Committee of WFLP 2003 selected, from all contributions presented at the workshop (which had been reviewed before the workshop), papers for inclusion into this special issue. The authors of all selected papers prepared revised versions after the workshop which were refereed again in order to ensure a high scientific quality. This volume contains the finally accepted versions based on this review process. In addition to the selected papers, the scientific program included invited lectures by Michael Rusinowitch (LORIA-INRIA-Lorraine, France) and Jan Maluszynski (Linköping University, Sweden).The program committee of WFLP 2003 consisted of María Alpuente(Technical University of Valencia, Spain)Sergio Antoy(Portland State University, USA)Annalisa Bossi(Università Ca' Foscari di Venezia, Italy)Olaf Chitil(University of York, UK)Rachid Echahed(Institut IMAG, France)Sandro Etalle(University of Twente, The Netherlands)Moreno Falaschi(Università di Udine, Italy)Michael Hanus(CAU Kiel, Germany)Yukiyoshi Kameyama(University of Tsukuba, Japan)Herbert Kuchen(University of Muenster, Germany)Michael Leuschel(University of Southampton, UK)Juan José Moreno-Navarro(Universidad Politécnica de Madrid, Spain)Ernesto Pimentel(University of Málaga, Spain)Mario Rodríguez-Artalejo(Universidad Complutense de Madrid, Spain)Germán Vidal(Technical University of Valencia, Spain)Organizing committee: Elvira Albert, Santiago Escobar, César Ferri, José Hernández, Carlos Herrero, Pascual Julián, Marisa Llorens, Ginés Moreno, Javier Oliver, Josep Silva, Germán Vidal, and Alicia VillanuevaAdditional referees: Elvira Albert, Zena Ariola, Demis Ballis, Bernd Brassel, Ricardo Corin, Agostino Dovier, Francisco Durán, Santiago Escobar, José Gallardo, Raffaella Gentilini, Angel Herranz, Teresa Hortalá-González, Zhenjiang Hu, Frank Huch, Pascual Julián, Christoph Lembeck, Pablo López, Salvador Lucas, Massimo Marchiori, Julio Mariño, Yasuhiko Minamide, Angelo Montanari, Ginés Moreno, Roger Müller, Susana Muñoz, Salvatore Orlando, Carla Piazza, Femke van Raamsdonk, María José Ramírez, Guido Sciavicco, Clara Segura, Jan-Georg Smaus, Andrew Tolmach, Alberto Verdejo, and Alicia Villanueva.Sponsoring institutions:Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Generalitat Valenciana, Ministerio de Ciencia y Tecnología, European Association for Theoretical Computer Science, European Association for Programming Languages and Systems, CologNET: A Network of Excellence in Computational Logic, and APPSEM Working Group.I would like to thank the invited speakers for their willingness in accepting our invitation. I would also like to thank all the members of the Program Committee and all the referees for their careful work in the review and selection process. Many sincere thanks to all authors who submitted papers and to all conference participants. I gratefully acknowledge all the institutions and corporations who have supported this workshop. Furthermore, I would like to thank Michael Mislove, Managing Editor of the ENTCS series, for making this special issue possible. Finally, I express my gratitude to all members of the local Organizing Committee whose work has made the workshop possible.November 6, 2003Germán Vidal

Preface: Volume 82, Issue 8

First Workshop on Object Oriented DevelopmentsThis volume contains the Proceedings of the First Workshop on Object Oriented Developments (WOOD'2003). The Workshop was held in Warsaw, Poland on April 13, 2003, as a satellite event to ETAPS'2003.Object-oriented programming languages have long been the subject of extensive foundational and applied research in a wide range of fields, including semantics, type theory, program verification and program development. More recently, object-oriented programming has emerged as an effective paradigm for structuring, composing and coordinating concurrent, distributed, and mobile code. The workshop provided a forum for discussion about theoretical work on object-oriented models and type systems, as well as presentation of experience reports on, and novel techniques for, program analysis and verification.The volume includes two invited presentations, and five papers selected for publication by the following Program Committee Members: •Viviana Bono (University of Torino, Italy)•Michele Bugliesi (University of Venezia, Italy)•Giuseppe Castagna(Ecole Normale Superieure, Paris, France)•Adriana Compagnoni(Stevens Institute of Technology, USA)•Kathleen Fisher(AT&T Labs, USA)•Matthew Flatt(University of Utah, USA)•Julian Rathke(University of Sussex, UK)•Christopher Stone(Harvey Mudd College, USA))This volume will be published as Volume 82 in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URLhttp://www.elsevier.nl/locate/entcsWe would like to thank all who contributed to the success of WOOD2003:the participants, the invited speakers Kim B. Bruce and Vladimiro Sassone, the authors, the PC members, the ETAPS organisers and the ENTCS editors. Special thanks to Damian Niwinski for his help with the organization of the Workshop, to Michael Mislove and Elsevier Publishers for making it possible to include our proceedings in Electronic Notes in Theoretical Computer Science and to Warsaw University for printing the hard copy of our proceedings. June 15, 2003Viviana Bono and Michele Bugliesi

Preface: Volume 81

ForewordThe main mathematical disciplines that have been used in theoretical computer science are discrete mathematics (especially, graph theory and ordered structures), logics (mostly proof theory for all kinds of logics, classical, intuitionistic, modal etc.) and category theory (cartesian closed categories, topoi etc.). General Topology has also been used for instance in denotational semantics, with relations to ordered structures in particular.Recently, ideas and notions from mainstream "geometric" topology and algebraic topology have entered the scene in Concurrency Theory and Distributed Systems Theory (some of them based on older ideas). They have been applied in particular to problems dealing with coordination of multi-processor and distributed systems. Among those are techniques borrowed from algebraic and geometric topology: Simplicial techniques have led to new theoretical bounds for coordination problems. Higher dimensional automata have been modelled as cubical sets with a partial order reflecting the time flows, and their homotopy properties allow to reason about a system's global behaviour.This workshop aims at bringing together researchers from both the mathematical (geometry, topology, algebraic topology etc.) and computer scientific side (concurrency theorists, semanticians, researchers in distributed systems etc.) with an active interest in these or related developments.It follows the first workshop on the subject "Geometric and Topological Methods in Concurrency Theory" which has been held in Aalborg, Denmark, in June 1999. Then came GETCO'00 in Pennstate, USA, GETCO'01 in Aalborg, Denmark, all associated with CONCUR. This time, GETCO'02 was associated with DISC'02 in Toulouse, as these geometric methods are also applied successfully in the realm of distributed systems.The Workshop has been financially supported by GdR CNRS "Algorithmique, Langage et Programmation" and "Architecture, Réseaux et Systèmes, Parallélisme" and the Basic Research Institute in Computer Science (Aarhus, Denmark), and I thank these institutions for this, and more specifically Christiane Frougny and Luc Bougé. I also wish to thank the referees, the authors and the programme committee members for their very precise and timely job. Many thanks are also due to Michael Mislove who kindly supported the workshop by letting us submit the papers through the Electronic Notes in Theoretical Computer Science. Last but not least, I wish to thank the DISC organizers, in particular Gérard Padiou and Anne-Marie Zerr, for making this possible.

Preface: Volume 68, Issue 5

A large class of systems can be specified and verified by abstracting away from the temporal aspects. In time-critical systems, instead, time issues become essential. Their correctness depends not only on which actions a system can perform but also on their execution time. Due to their importance, time-critical systems have attracted the attention of a considerable number of computer scientists from various research areas.This volume contains the Proceedings of the 3rd International Workshop on Models for Time-Critical Systems (MTCS 2002); MTCS 2002 was held on August 24, 2002 as one of seven satellite workshops co-located with the 13th International Conference on Concurrency Theory (CONCUR 2002), held in Brno (Czech Republic) August 20-23, 2002.The first workshop, MTCS 2000, was held in State College (Pennsylvania, USA) on August 26 2000, co-chaired by Flavio Corradini and Paola Inverardi. while the second workshop, MTCS 2001, was held in Aalborg (Denmark) on August 25, 2001, co-chaired by Flavio Corradini and Walter Vogler. As for the first two workshops, the objectives of MTCS 2002 were (i) to present and discuss promising new proposals on models for time-critical systems, ranging from theory to practice and (ii) to promote interaction between different research areas in the field of time-critical systems. Despite its focus on time-critical systems, MTCS 2002 was also open for time-related issues in general, e.g. performance in systems where time is not critical for the functional behaviour.The papers in this volume were selected for presentation by the Program Committee from submissions received in response to a Call for Papers. Many thanks are due to the members of the Program Committee as well as their sub-referees for their accurate work, and also to the invited speakers P. S. Thiagarajan (Chennai Mathematical Institute) and Walter Vogler (University of Augsburg). We would also like to thank Michael Mislove for his help during the proceedings editorial process and BRICS for the publication of the preliminary proceedings. Finally, our thanks go to Petr Jancar and Mojmir Kretinsky (CONCUR 2002 Conference Chairs) and Antonin Kucera (Workshops Coordinator) for the opportunity they gave us to organize MTCS 2002 and for their support.The papers in this volume were reviewed by the program committee consisting of Rajeev Alur(USA)Jos Baeten(Netherlands)Frank de Boer(Netherlands)Flavio Corradini(Italy)Kim Larsen(Denmark)Gerald Lüttgen(United Kingdom)Jeff Magee(United Kingdom)Andrea Maggiolo-Schettini(Italy)Paul Pettersson(Sweden)Steve Schneider(United Kingdom)Bran Selic(USA)Joseph Sifakis(France)P. S. Thiagarajan(India)Walter Vogler(Germany)A printed version of the current volume was distributed to the participants at the workshop in Brno.April 24, 2003 Walter Vogler, Kim Larsen

Preface: Volume 44, Issue 3

Preface: Volume 44, Issue 3

Preface: Volume 78

Computing: the Australasian Theory Symposium (CATS) is the premier theoretical computer science conference in Australasia, and originated as a meeting organised by Barry Jay in December, 1994 in Sydney. Since then, it has become an integral part of the series of meetings that comprise the Australasian Computer Science Week (ACSW), and hence previous CATS meetings have been held in Melbourne (1996), Sydney (1997), Perth (1998), Auckland (1999), Canberra (2000), the Gold Coast (2001) and Melbourne (2002).Following the pattern set at the 2000 meeting in Canberra, it is very pleasing to see the proceedings of this conference published as volume78 of Electronic Notes in Theoretical Computer Science. This ensures rapid dissemination of results, as well as simplifying conference organisation and significantly reducing costs.A total of 31 papers were submitted, of which 17 were selected for publication, after review by at least 2 (and usually 3) referees. The two invited speakers, Arun Sharma and George Havas, are both resident in Australia, but the Programme Committee felt that both were of such elevated international standing that this really counts as two international speakers.Conferences such as CATS are always the result of the efforts of a number of people. Accordingly, my thanks go to all who submitted papers, succesfully or otherwise, the additional referees for their efforts in reviewing papers, Michael Mislove (joint Managing Editor of ENTCS) for his advice and producing the relevant macros, John Roddick and the local organising committee for ACSW, Michael Oudshoorn, the ACSW Programme Chair, and finally the hard-working Programme Committee members.Programme Committee•Michael Atkinson, Otago University, Dunedin, New Zealand.•John Crossley, Monash University, Melbourne, Australia.•XiaoTie Deng, City University of Hong Kong.•Mike Fellows, Newcastle University, Australia.•Colin Fidge, University of Queensland, Brisbane, Australia.•James Harland (Chair), RMIT University, Melbourne, Australia.•Matthew Hennessy, University of Sussex, Brighton, UK•Barry Jay, University of Technology, Sydney, Australia.•Mike Johnson, Macquarie University, Sydney, Australia.•Xuemin Lin, University of New South Wales, Sydney, Australia.•David WolframAdditional RefereesJianer ChenShirley H.C. CheungRobert ColombMichael HouleHans HuttelSleksander IgnjatovicEd KazmierczakJianping LiWiafa LiangSeng LokeFaron MollerChung Keung PoonDavid PymPeter RobinsonDon SannellaHarald SondergaardArcot SowmyaFeng TianHagen VolzerLuke WildmanMichael WinikoffDavid WoodLimsoon WongDavid WrightJian XuJingling XueQing Zhang

Preface: Volume 68, Number 3

Modern information systems rely more and more on combining concurrent, distributed, mobile and heterogenous components. This move from old systems, typically conceived in isolation, induces the need for new languages and software architectures. In particular, coordination languages have been proposed to cleanly separate computational aspects and communication. On the other hand, software architects face the problem of specifying and reasoning about non-functional requirements. All these issues are widely perceived as fundamental to improve software productivity, to enhance maintainability, to advocate modularity, to promote reusability, and to lead to systems more tractable and more amenable to verification and global analysis.The FOCLASA workshop was organized on August 24th 2002 as a satellite event of Concur'02 with the aim of bringing together researchers working on the foundations of component-based computing, coordination, and software architectures.This volume contains selected 12 papers presented at the workshop. They were reviewed by the program committee, consisting, besides the editors, of •Rocco De Nicola (University of Firenze, Italy)•Jos Luiz Fiadeiro (ATX Software and University of Lisbon, Portugal)•Roberto Gorrieri (University of Bologna, Italy)•Paola Inverardi (University L'Aquila, Italy)•Joost Kok (University of Leiden, The Netherlands)•Antonio Porto (New University of Lisbon, Portugal)We would like to thank them together with the authors of the papers for their contribution to the meeting. We would also like to thank Michael Mislove for his help in editing this volume. Finally, we are grateful to L. Brim, M. Kretinsky, and A. Kucera for their help in organizing the workshop in Brno.

Preface: Volume 39, Issue 1

The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power.The EXPRESS workshops were originally held as meetings of the HCM project EXPRESS, which was active with the same focus from January 1994 till December 1997. The first three workshops were held respectively in Amsterdam (1994, chaired by Frits Vaandrager), Tarquinia (1995, chaired by Rocco De Nicola), and Dagstuhl (1996, co-chaired by Ursula Goltz and Rocco De Nicola). The workshop in 1997, which took place in Santa Margherita Ligure and was co-chaired by Catuscia Palamidessi and Joachim Parrow, was organized as a conference with a call for papers and a significant attendance from outside the project. The 1998 workshop was held as a satellite workshop of the CONCUR'98 conference in Nice, co-chaired by Ilaria Castellani and Catuscia Palamidessi, and like on that occasion EXPRESS'99 was hosted by the CONCUR'99 conference in Eindhoven, co-chaired by Ilaria Castellani and Björn Victor.This volume contains the Proceedings of EXPRESS'00, which was held in State College (Pennsylvania, USA) on 21 August 2000. It includes the six papers that were selected for presentation by the program committee, together with the contribution by the invited speaker, Neil D. Jones (DIKU, Denmark).We would like to thank the authors of the submitted papers, the invited speakers, and the members of the program committee for their contribution to both the meeting and this volume. Many thanks to Catuscia Palamidessi and Dale Miller (CONCUR 2000 Conference Chairs), and Uwe Nestmann (Satellite Workshops Chair), for the opportunity they gave us to organize EXPRESS'00, and for their continuous support. We would also like to thank Michael Mislove and Uffe Engberg for their help with the editing of the proceedings. Finally, we gratefully acknowledge the support of BRICS (Basic Research in Computer Science), Centre of the Danish National Research Foundation.EXPRESS'00 Programme CommitteLuca Aceto(DK)Karen Bernstein Jeffrey(USA)Rance Cleaveland(USA)Wan Fokkink(NL)Rob van Glabbeek(NL)Ursula Goltz(DE)Rosario Pugliese(IT)Julian Rathke(UK)Davide Sangiorgi(FR)Björn Victor(SE)Igor Walukiewicz(PL)Luca Aceto and Björn Victor, Guest Editors

Preface: Volume 68, Issue 6

INFINITY 2002, the 4th International Workshop on Verification of Infinite-State Systems, was held as a satellite workshop of CONCUR 2002 (the 13th International Conference on Concurrency Theory) in Brno, Czech Republic, on August 24, 2002. The aim of the workshop is to provide a forum for researchers interested in the development of mathematical techniques for the analysis and verification of systems with infinitely many states. The topics of INFINITY 2002 included the following: techniques for modeling and analysis of infinite-state systems, equivalence-checking and model-checking with infinite-state systems, parameterized systems, calculi for mobility and security, finite-state abstractions of infinite-state systems.The volume consists of six contributed papers selected by the INFINITY 2002 programme committee. The papers were reviewed by the program committee consisting, besides editors, of Parosh Abdulla(Uppsala (SE))Julian Bradfield(Edinburgh (UK))Didier Caucal(Irisa (F))Hubert Comon(LSV Cachan (F))Giorgio Delzanno(Genova (I))Yoram Hirshfeld(Tel-Aviv (Israel))Denis Lugiez(Marseille (F))Bernhard Steffen(Dortmund (D))P.S. Thiagarajan(Chennai (India))Moshe Vardi(Rice (USA))The programme of INFINITY 2002 was further enriched by an invited talk given by Colin Stirling, and by four short presentations of work in progress.This volume will be published as volume 68(6) in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcsWe are very grateful to the CONCUR 2002 Organizing Committee for arranging all local affairs, and to Michael Mislove, the managing editor of ENTCS, for providing the opportunity to publish the INFINITY 2002 proceedings in the ENTCS series.December 9, 2002 Antonin Kucera, Richard Mayr

Preface: Volume 70, Issue 6

2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) - Final Proceedings This volume contains the final post-workshop proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002). The workshop was held in conjunction withRTA 2002 in Copenhagen, Denmark, on July 21, 2002.Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. WRS 2002 is the second edition in a series of workshops intended to stimulate and promote research and progress in this important field. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. WRS 2001 took place in Utrecht, The Netherlands, on May 26, 2001.Topics of interest for the workshop included, but were not restricted to,theoretical foundations for the definition and semantic description of reduction strategies,strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages),properties of reduction strategies/computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness),interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.),program analysis and other semantics-based optimization techniques dealing with reduction strategies,rewrite systems/tools/implementations with flexible/programmable strategies as essential concept/ingredient,specification of reduction strategies in (real) languages,data structures and implementation techniques for reduction strategies.The program committee received ten submissions. Based on the careful refereeing process for WRS 2002, the following regular papers have been accepted for inclusion in the final post-workshop proceedings, published in this volume of Electronic Notes in Theoretical Computer Science:An Operational Semantics for Declarative Multi-Paradigm Languagesby Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, and Germán VidalApplying ELAN Strategies in Simulating Processors over Simple Architecturesby Mauricio Ayala-Rincón, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, and Reiner W. HartensteinTerm Rewriting with Type-safe Traversal Functionsby Mark G.J. van den Brand, Paul Klint, and Jurgen J. VinjuAn Abstract Böhm-normalizationby John Glauert and Zurab KhasidashviliThe Sketch of a Polymorphic Symphonyby Ralf LämmelStrategies for Source-to-Source Constant Progagationby Karina Olmos and Eelco VisserRegular Sets of Descendants by Leftmost Strategyby Pierre Réty and Julie VuottoFurthermore, this volume also contains the following invited papersApproximations for Strategies and Terminationby Aart MiddeldorpOptimal Strategies in Higher-Order Rewritingby Vincent van Oostrom and Roel de VrijerThe program committee of WRS 2002 consisted of program committeeSergio AntoyPortland State University (USA)Roberto di CosmoUniversité de Paris VII (France)Bernhard Gramlich (co-chair)TU Wien (Austria)Michael HanusChristian-Albrechts-Universität zu Kiel (Germany)Claude KirchnerLORIAPaul KlintCWI Amsterdam (The Netherlands)Salvador Lucas (co-chair)TU Valencia (Spain)Manfred Schmidt-SchaussJohann Wolfgang Goethe-Universität, Frankfurt a.M. (Germany)Yoshihito ToyamaU Tohoku (Japan)Regarding the refereeing process we are very grateful to the program committee and to the additional external referees: María Alpuente, César Ferri, Matthias Mann, Huy Nguyen, and Ricardo Peña. Furthermore we would like to thank Michael Mislove, Managing Editor of the ENTCS series, for his technical assistance with using the ENTCS format.December 10, 2002Bernhard Gramlich and Salvador Lucas

Preface: Volume 76

This volume contains selected papers presented at the 11th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2002). The workshop was held in Grado (Italy) during June 20-22, 2002 and was organized by Dipartimento di Matematica e Informatica of the University of Udine. This workshop is the continuation of a successful series of annual workshops on declarative programming which aims to bring together researchers interested in functional programming, (constraint) logic programming, as well as their integration. Recent editions of the workshop have been held in Kiel (Germany), Benicassim (Spain), Grenoble (France), Bad Honnef (Germany).The workshop in Grado promoted the cross-fertilizing exchange of ideas and experiences among researches and students from the different communities interested in the foundations, applications, software engineering techniques and combinations of high-level, declarative (constraint) programming languages and related areas. The technical program of the workshop included invited talks, presentations of refereed papers and demo presentations.The Program Committee of WFLP 2002 collected for each paper at least three reviews and held an electronic discussion on all papers during May 2002. This resulted in a selection of 23 papers and 3 system descriptions for presentation at the workshop. In addition to the selected papers, the scientific program included invited lectures by Yike Guo, Peter Thiemann and Giorgio Delzanno. Further information on the workshop can be found at the WFLP02 web page.The Program Committee of WFLP 2002 selected, from all contributions presented at the workshop, papers for inclusion into this special issue. In order to ensure a high scientific quality, the authors of all selected papers prepared revised versions after the workshop, also taking into account the feedback received during the presentations. Out of the 23 presented papers 14 were selected for inclusion in this volume, in addition to 2 papers of the invited speakers.The program committee of WFLP 2002 consisted of María Alpuente(Technical Univ. of Valencia)Sergio Antoy(Portland State Univ.)Manuel Chakravarty(Univ. of New South Wales, Sidney)Rachid Echahed(IMAG, Grenoble)Francois Fages(INRIA Rocquencourt)Moreno Falaschi(Univ. of Udine, chair)Thom Frühwirth(LMU Munich)Robert Glück(Waseda Univ., Japan and DIKU, Denmark)Michael Hanus(CAU Kiel)Tetsuo Ida(Univ. of Tsukuba)Helene Kirchner(LORIA - INRIA Lorraine)Herbert Kuchen(Univ. of Muenster)Michael Maher(Loyola Univ. Chicago)Juan Jose Moreno Navarro(UP Madrid)Ernesto Pimentel(Univ. of Malaga)Mario Rodriguez-Artalejo(UC Madrid)We would like to thank all the members of the Program Committee and all the referees for their careful work in the review and selection process. Furthermore, we would like to thank Michael Mislove, Managing Editor of the ENTCS series, for making this special issue possible. Finally, many sincere thanks to all authors who submitted papers and to all conference participants.October 2002Marco CominiMoreno Falaschi

Preface

Preface

Preface: Volume 64

This volume contains selected papers presented at the International Workshop on Functional and (Constraint) Logic Programming (WFLP 2001). The workshop was held in Kiel, Germany, during September 13-15, 2001. It is the combination of two workshops of a successful series of annual workshops on declarative programming. The international workshops on functional and logic programming aimed at bringing together researchers interested in functional programming, logic programming, as well as their integration. Previous workshops have been held in Benicassim (Spain), Grenoble (France), Bad Honnef (Germany). The workshops on (constraint) logic programming are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland.On this occasion, both workshops were jointly organized in order to promote the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. The technical program of the workshop included invited talks, presentations of refereed papers and system demonstrations.The Program Committee of WFLP 2001 selected from all contributions presented at the workshop, which had been reviewed before the workshop, papers for inclusion into this special issue. The authors of all selected papers prepared revised versions after the workshop which were refereed again in order to ensure a high scientific quality. This volume contains the finally accepted versions based on this review process.The program committee of WFLP 2001 consisted of Slim AbdennadherLMU MünchenMaría AlpuenteUP ValenciaSergio AntoyPortland State UniversityChristoph BeierleFernUniv. HagenAlexander BockmayrUniv. Henri Poincaré, NancyHarold BoleyDFKI KaiserslauternFrançois BryLMU MünchenJürgen DixUniv. ManchesterRachid EchahedIMAG, GrenobleUwe EglyTU WienMoreno FalaschiUniv. UdineBurkhard FreitagUniv. PassauThom FrühwirthLMU MünchenNorbert E. FuchsUniv. ZürichUlrich GeskeGMD-FIRST BerlinMichael HanusCAU Kiel (chair)Herbert KuchenUniv. MünsterJuan José Moreno NavarroUP MadridMario Rodríguez-ArtalejoUC MadridDietmar SeipelUniv. WürzburgI am grateful to all the members of the Program Committee and all the referees for their careful work in the review process. Furthermore, I would like to thank Michael Mislove, Managing Editor of the ENTCS series, for making this special issue possible.August 21, 2002 Michael Hanus

Preface: Volume 52, Issue 2

The main mathematical disciplines that have been used in computer science are discrete mathematics (especially, graph theory and ordered structures), logics (mostly proof theory for all kinds of logics, classical, intuitionistic, modal etc.) and category theory (cartesian closed categories, topoi etc.). General Topology has also been used for instance in denotational semantics, with relations to ordered structures in particular. Recently, ideas and notions from mainstream “geometric” topology and algebraic topology have entered the scene in Concurrency Theory and Distributed Systems Theory (some of them based on older ideas). They have been applied in particular to problems dealing with coordination of multi-processor and distributed systems. Among those are techniques borrowed from algebraic and geometric topology: Simplicial techniques have led to new theoretical bounds for coordination problems. Higher dimensional automata have been modelled as cubical complexes with a partial order reflecting the time flows, and their homotopy properties allow to reason about a system's global behaviour. The first workshop on the subject “Geometric and Topological Methods in Concurrency Theory” has been held in Aalborg, Denmark, in June 1999. GETCO 2000 was organised as a workshop affiliated with CONCUR 2000 at Penn State University. The recent volumes 10 of Math. Struct. in Comp. Science and 39, issue 2, of Electr. Notes Theor. Comp. Science have been devoted to this area. The 3rd workshop in this series has been organised as a satellite to CONCUR 2001 at Aalborg University (Aug.21 – Aug.24). It brought together researchers from both the mathematical (geometry, topology, algebraic topology etc.) and computer scientific side (concurrency theorists, semanticians, researchers in distributed systems etc.) with an active interest in these or related developments. A follow up workshop in a very informal style has been held at the Department of Mathematical Sciences, Aalborg University, on August 27-28. I also thank the participants of this workshop which allowed us to carry on some of the discussions which began during GETCO, and in particular Ulrich Fahrenberg (Aalborg University, Denmark), Lisbeth Fajstrup (Aalborg University, Denmark), Martin Raussen (Aalborg University, Denmark), Philippe Gaucher (IRMA, Strasbourg, France), Nigel Walker (British Telecom, UK) and Francesco Zappa Nardelli (ENS, France). Last but not least, I wish to thank the referees, the authors and the programme committee members for their very precise and timely job. Many thanks are also due to Michael Mislove who kindly supported the workshop by letting us submit the papers through the Electronic Notes in Theoretical Computer Science. Finally, I wish to thank the Concur organizers, Anna Ingolfsottir, Luca Aceto and Arne Skou, the Concur programme committee and in particular Kim G. Larsen and Mogens Nielsen, and the Workshop coordinator, Hans Hüttel, for helping us out.

Preface: Volume 52, Issue 3

A large class of systems can be specified and verified by abstracting away from the temporal aspects. This is the class of systems where time affects the performance but not the functional behaviour. In time-critical systems, instead, time issues become essential. Their correctness depends not only on which actions a system can perform but also on their execution time. Due to their importance, time-critical systems have attracted the attention of a considerable number of computer scientists from various research areas.This volume contains the Proceedings of the 2nd International Workshop on Models for Time-Critical Systems (MTCS 2001); MTCS 2001 was held on 25 August 2001 as one of five satellite workshops co-located with the 12th International Conference on Concurrency Theory (CONCUR 2001), held in Aalborg (Denmark) 21-24 August 2001.The first workshop, MTCS 2000, was held in State College (Pennsylvania, USA) on 26 August 2000, co-chaired by Flavio Corradini and Paola Inverardi. As for MTCS 2000, the objectives of MTCS 2001 were (i) to validate the more promising proposals on models for time-critical systems, ranging from theory to practice and (ii) to promote interaction between different research areas in the field of time-critical systems. Despite its focus on time-critical systems, MTCS 2001 was also open for more general time-related issues.The papers in this volume were selected for presentation by the Program Committee from submissions received in response to a Call for Papers. This volume will be published as volume 52 in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcsThe volume includes the contribution by the Invited Speaker Jos Baeten (Eindhoven University of Technology).We would like to thank Kim G. Larsen and Mogens Nielsen (CONCUR 2001 Conference Chairs) and Hans Huttel (Satellite Workshops Chair) for the opportunity they gave us to organize MTCS 2001 and for their support. Many thanks are due to Jos Baeten (Invited Speaker), and to the members of the Program Committee as well as their sub-referees for their accurate work. We would also like to thank Michael Mislove for his help during the proceedings editorial process and to BRICS for the publication of the preliminary proceedings.The papers in this volume were reviewed by the program committee consisting of Rajeev Alur(USA)Jos Baeten(NL)Frank de Boer(NL)Flavio Corradini(IT)Paola Inverardi(IT)Jeff Kramer(UK)Gerald Luettgen(UK)Jeff Magee(UK)Andrea Maggiolo-Schettini(IT)Bran Selic(CA)Joseph Sifakis(FR)Walter Vogler(DE)A printed version of the current volume is distributed to the participants at the workshop in Aalborg.May 7, 2002Flavio Corradini, Walter Vogler

Preface: Volume 65, Issue 2

Semantics preservation between source and target program is the commonly accepted minimum requirement to be ensured by compilers. It is the key term compiler verification and optimization are centered around. The precise meaning, however, is often only implicit, e.g.~when tacitly exploiting the scope provided by often in part loose specifications of the semantics of the considered languages. As a rule of thumb, verification tends to interpret semantics preservation in a very tight sense, not only but also to simplify the verification task. Optimization generally prefers a more liberal view in order to enable more powerful transformations otherwise excluded. In each case the semantics of the underlying languages and the preservation of the semantics of the considered programs are the surveyor's rod of admissibility. While undisputed on the level of these abstract terms, the adequate perception of preservation is still an issue of scientific research, which, e.g., depends and varies fluently with the application context (compiling and optimizing “stand-alone” applications, communicating systems, reactive systems, etc.).The aim of the workshop is to bring together researchers and practitioners working on optimizing and verifying compilation as well as on related fields such as programming language design and semantics in order to plumb the mutual impact of these fields on each other, the degrees of freedom optimizers and verifiers have, to bridge the gap between the communities, and to stimulate synergies.The contributed papers accepted for presentation at the workshop and an invited presentation by Gerhard Goos discuss topics such as certifying compilation, verifying compilation, translation validation, and optimization showing both the breadth of research in the fields of optimizing and verifying compilation and their interdependencies as well as the diversity of approaches for addressing and handling them. In the invited keynote speech, Gerhard Goos emphasizes that it is not the compiler but the code generated by it which must be correct. He points out that this subtle difference provides the key for reusing standard compiler architecture, tools and methods in a verifying compiler. In the first contributed paper, Lenore Zuck et al. demonstrate how the correctness of optimizing loop transformations can be checked without proving the correctness of the compiler itself. This technique is called translation validation. Glesner et al. show how to construct correct code-generators for embedded systems. They use a similar technology as Zuck et al. Frederiksen subsequently discusses correctness proofs of global optimizations. These optimizations are modeled as conditional graph-rewrite rules. Nguyen and Irigoin discuss in their paper how to verify aliases in FORTRAN. The non-presence of aliases is an important pre-condition of many optimizations. Shashidar et al. also discuss correctness of loop transformations. In contrast to the approach of Zuck et al.~they distinguish the correctness proof for transformations and their implementation. Jamarillo et al. use translation validation for checking the correctness of some transformations at lower levels of compilers such as register allocation. Goerigk, finally, discusses notions of compiler correctness and shows how they apply to optimizations.The papers in this volume were reviewed by the members of the program committee consisting, besides the editors, of •Rajiv Gupta, University of Arizona, Tucson, AZ, USA, gupta@cs.arizona.edu•James R. Larus, Microsoft Research, Redmond, WA, USA, larus@microsoft.com•Robert Morgan, Compaq Computer Corporation, Nashua, NH, USA, bob.morgan@compaq.com•J Strother Moore, University of Texas at Austin, TX, USA, Moore@cs.utexas.edu•Markus Müller-Olm, Universität Dortmund, Germany, mmo@ls5.cs.uni-dortmund.de•George C. Necula, University of California at Berkely, CA, USA, necula@cs.berkeley.edu•John Whaley, IBM Tokyo Research Laboratory, Tokyo, Japan, jwhaley@alum.mit.edu•Jim Woodcock, Oxford University, UK, Jim.Woodcock@comlab.ox.ac.ukIn closing, we would like to thank the many persons, whose help has been crucial for the success of COCV 2002. First of all, we would like to thank the organizers of ETAPS 2002, in particular, Rachid Echahed, the workshop chair of ETAPS 2002, for their help with the organization of the workshop as satellite event of ETAPS 2002. We are also grateful to Axel Dold, Werner Gabrisch, and Michael Schaarschmidt for their help as external reviewers, and to Michael Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files. Furthermore, we would like to thank the participants of the Dagstuhl Seminar 00381: Code Optimisation: Trends, Challenges and Perspectives for their discussions. These discussions led to the idea of this workshop. Last but not least, we would like to thank the authors who submitted a contribution.

Preface: Volume 57

1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001)This volume contains the post-workshop proceedings of the 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001). The workshop was held in conjunction with RTA 2001 in Utrecht, The Netherlands, on May 26, 2001.The motivation to organize this forum stems from the fact that reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages.Topics of interest for the workshop included, but were not restricted to, •theoretical foundations for the definition and semantic description of reduction strategies•strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages)•properties of reduction strategies/computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness)•interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.)•program analysis and other semantics-based optimization techniques dealing with reduction strategies•rewrite systems/tools/implementations with flexible/programmable strategies as essential concept/ingredient•specification of reduction strategies in (real) languages•data structures and implementation techniques for reduction strategies.Based on the careful refereeing process for WRS 2001, the following regular papers were accepted: •Declarative Debugging of Functional Logic Programs by María Alpuente, Francisco J. Correa and Moreno Falaschi•Just-in-time: On Strategy Annotations by Jaco van de Pol•Generic Sort-Preserving Traversal Strategies by Ralf Lämmel•Compact Normalisation Trace via Lazy Rewriting by Quang-Huy Nguyen•Fusing Logic and Control with Local Transformations: An Example Optimization by Patricia Johann and Eelco Visser•The Simple Type Theory of Normalization by Evaluation by René VestergaardFurthermore this volume also contains the two invited papers •Evaluation Strategies for Functional Logic Programming by Sergio Antoy•A Survey of Strategies in Program Transformation Systems by Eelco Visseras well as the worked out panel contributions •Reduction Strategies for Declarative Programming by Michael Hanus•Hot Topics in Reduction Strategies - a panelist's view by Tetsuo Ida•Is Strategic Programming a Viable Paradigm? by Paul Klintabout the theme Hot Topics in Reduction Strategies.The program committee of WRS 2001 consisted of María AlpuenteTU Valencia (Spain)Rachid EchahedIMAG Grenoble (France)Bernhard Gramlich (co-chair)TU Wien (Austria)Salvador Lucas (co-chair)TU Valencia (Spain)Vincent van OostromU Utrecht (The Netherlands)Rinus PlasmeijerKU Nijmegen (The Netherlands)Manfred Schmidt-SchaussU Frankfurt a.M. (Germany)Yoshihito ToyamaU Tohoku (Japan)Regarding the refereeing process we are very grateful to the program committee and to the additional external referees. Furthermore we would like to thank Michael Mislove, Managing Editor of the ENTCS series, for his technical assistance with using the ENTCS format.November 25, 2001Bernhard Gramlich and Salvador Lucas

Preface: Volume 23, Issue 2

This volume contains the proceedings of the First International Workshop on Symbolic Model Checking (SMC'99), held in Trento, Italy, on July 6, 1999, as part of the Second Federated Logic Conference (FLoC'99).Symbolic model checking is a formal technique for the verification of finite-state concurrent systems. Symbolic model checkers (e.g. SMV, VIS) have been used to verify industrial systems, ranging from hardware to communication protocols to safety critical plants and procedures. Symbolic model checking is the core technique for several industrial verification tools, and is applied in technology transfer projects. The aim of the SMC'99 workshop is to bring together active developers and users of symbolic model checkers, compare state of the art model checking techniques (e.g. compositional reasoning, abstraction, partitioning), discuss experimental results and experience reports, and promising directions for future research.Nine contributions (out of twenty-two submissions) were selected for presentation by the program committee. The workshop program is completed by two keynote invited lectures, given by Ken McMillan (Cadence Labs, USA) on Compositional Reasoning and Abstraction, and Fabio Somenzi (University of Colorado, USA) on Symbolic State ExplorationThanks are due to a number of people who helped to organize and plan the workshop. Among this group are the Program Committee members: Adnan Aziz(University of Texas at Austin, USA)Armin Biere(Verysys)Sergio Campos(Federal University of Minas Gerais, Brazil)Alessandro Cimatti(IRST, Italy)Edmund Clarke(Carnegie Mellon University, USA)Danny Geist(IBM Haifa, Israel)Fausto Giunchiglia(IRST, Italy)Orna Grumberg(Technion, Israel)Markus Kaltenbach(Siemens, Germany)Carl Pixley(Motorola, USA)The following people helped in the evaluation of the submissions: Yael Abarbanel-Vinov, Neta Aizenbud-Reshef, Shoham Ben-David, Doron Bustan, Jorge Cuellar, David Deharbe, Cindy Eisner, Ranan Fraer, Edelweis Garcez, Leonid Gluhovsky, Marcelo Glusman, Jae-Young Jang, Shmuel Katz, Sharon Keidar, Monika Maidl, Robi Malik, Anamaria Martins Moreira, Shiri Moran, Peter Päppinghaus, Marco Roveri, Peter Warkentin, Karen Yorav, Jun Yuan, Yunshan Zhu.We would like to thank IBM Haifa Research Laboratory for the financial support to SMC'99. Carola Dori, Morena Carli, Marco Roveri and Adolfo Villafiorita helped in several matters related to the local organization. Finally, we are grateful to Michael Mislove for his constat support during the preparation of this electronic volume.Alessandro Cimatti and Orna Grumberg, Guest Editors

Preface: Volume 45

ForewordThis volume contains the Proceedings of MFPS 17, the Seventeenth Conference on the Mathematical Foundations of Programming Semantics. The conference was hosted by the Basic Research in Computer Science and Aarhus University, Aarhus, Denmark, and took place from May 23 through May 26, 2001.MFPS 17 featured invited talks by seven renowned scholars: •Olivier Danvy Aarhus•Joshua Guttman Mitre Corporation•Neil Jones DIKU•Kim Larsen Aalborg•Prakash Panangaden McGill•Jan Rutten CWI•Glynn Winskel CambridgeThere also were three special sessions: 1.A session honoring Neil Jones (DIKU) organized by Olivier Danvy (Aarhus) and David Schmidt (Kansas State University). The session began with Olivier Danvy's invited address, and included talks by Radhia Cousot (Ecole Polytechnique, Paris), John Hannan (Penn State), John Hughes (Chalmers), David Schmidt and Peter Sestoft (ITU and Royal Veterinary and Agricultural University).2.A session on model checking organized by Gavin Lowe (Oxford). The session began with Kim Parsen's invited address, and included talks by Jose Desharnais (Laval), Michael Huth (Kansas State and Imperial College), Henrik Jensen (BRICS), Marta Kwiatkowska (Birmingham) and Gavin Lowe.3.A session on security organized by Catherine Meadows (NRL). The session began with Joshua Guttman's invited address, and included talks by Andrew Gordon (Microsoft, Cambridge) and Alan Jeffrey (DePaul), Gavin Lowe, Thomas Jensen (INRIA), Dusko Pavlovic (Kestrel), Catherine Meadows and Andre Scedrov (Penn).The remainder of the program was made up of papers selected by the Program Committee from those submitted in response to the Call for Papers that was circulated in Fall, 2000. The Program Committee was co-chaired by Stephen Brookes (CMU) and Michael Mislove (Tulane) and included Lars Birkedal (ITU), Rance Cleaveland (SUNY, Stony Brook), Marcelo Fiore (Cambridge), Matthew Hennessy (Sussex), Alan Jeffrey (DePaul), Achim Jung (Birmingham), Gavin Lowe (Oxford), Catherine Meadows (NRL), Peter O'Hearn (QMW), Suysan Older (Syracuse), Dusko Pavlovic (Kestrel), Uday Reddy (Birmingham), Giuseppe Rosolini (Genoa), Davide Sangiori (INRIA) and Andre Scedrov (Penn). The Organizers of the MFPS series are Stephen Brookes, Michael Main (Colorado), Austin Melton (Kent State), Michael Mislove and David Schmidt. The Local Arrangements for the meeting were overseen by Olivier Danvy and Andrzej Filinski, both of BRICS and Aarhus. We are grateful to these colleagues for having so efficiently overseen the local arrangements. We also are happy to acknowledge the exceptional efforts of Karen Kjer Müller, who literally anticipated almost all of the needs of participants, and saw to it that every aspect of the meeting went off without any problems.Finally, we are extremely grateful for the financial support provided by BRICS and by the US Office of Naval Research, without which the meeting could not have taken place. We are particularly grateful to Dr. Ralph Wachter for his continuing interest in the MFPS series and the support his program in Software Systems has provided the series.Stephen Brookes and Michael Mislove, Guest Editors DedicationThe Organizers of the MFPS series are pleased to dedicate these Proceedings to Neil Jones for his continuing inspiration to the students and researchers in theoretical computer science. Neil has been a regular participant in the MFPS series, dating from his invited address at MFPS III in 1987. MFPS appreciates the continued inspiration that his teaching and research have provided and that his addresses to the MFPS community have so clearly elucidated.