Electronic Notes In Theoretical Computer Science Research Articles

L 009 Variables Related to Changes in Plasma Levels of Triglycerides and Fasting Blood Glucose After Short-term Red Wine Intake

This volume contains the Proceedings of the 9th Workshop on Logic, Language, Information and Computation (WoLLIC'2002). The Workshop was held in Rio de Janeiro, Brazil from July 30 to August 2, 2002, in the campus of the Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio).WoLLIC is a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation, and yet is small enough to allow for concrete and useful interaction among participants. Previous versions were held at: Recife (Pernambuco, Brazil) in 1994 and 1995; Salvador (Bahia, Brazil) in 1996; Fortaleza (Ceará, Brazil) in 1997; São Paulo (Brazil) in 1998; Itatiaia (Rio de Janeiro, Brazil) in 1999; Natal (Rio Grande do Norte) in 2000; Brasília (Distrito Federal, Brazil) in 2001. [new] Scientific sponsorship comes from the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).[end new] Scientific sponsorship comes from the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). Funding was kindly given by: (i) CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico, the scientific and technological development council of the Brazilian Ministério da Ciência e Tecnologia) (grant 451491/2002-5); (ii) CAPES (Fundação Coordenação de Apoio ao Aperfeiçoamento de Pessoal de Nível Superior, a Foundation for the Development of Higher-Education under the Brazilian Ministério da Educação e do Desporto) (grant PAEP0169/02-1); (iii) PUC-Rio (Pontifícia Universidade Católica do Rio de Janeiro). Contributions were received in the form of short papers in all areas related to logic, language, information and computation, including: pure logical systems, proof theory, model theory, algebraic logic, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic and program semantics, logics and models of concurrency, logic and complexity theory, proof complexity, foundations of cryptography (zero-knowledge proofs), descriptive complexity, nonclassical logics, nonmonotonic logic, logic and language, discourse representation, logic and artificial intelligence, automated deduction, foundations of logic programming, logic and computation, and logic engineering.Apart from the contributed papers (14), and the invited talks (6), the programme includes 6 tutorial lectures: •Some model theory of ordered structures by Ricardo Bianconi (Departamento de Matemática Pura, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil)•Computing with Real Numbers by Felipe Cucker (Department of Mathematics, City University of Hong Kong, People's Republic of China)•Model Checking Games by Erich Grädel (Mathematische Grundlagen der Informatik, RWTH Aachen, Germany)•The Metalanguage Lambda Prolog and its Implementation by Gopalan Nadathur (University of Minnesota, USA)•Automata theory and logic by Igor Walukiewicz (Bordeaux University, France)•States of Knowledge (Tutorial) by Rohit Parikh (Department of Computer and Information Science, Brooklyn College, City University of New York, USA)All papers in the volume were reviewed by the program committee consisting, besides editor, of The organising committee consisted, besides editor, of The volume will be published as volume 67 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/entcsA printed version of the current volume is distributed to the participants at the workshop in Rio de Janeiro.We are very grateful to the following persons, whose help has been crucial for the success of WoLLIC'2002: Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files; Thanks are also due to the Departments of Philosophy and Informatics of the Pontifícia Universidade Católica of Rio de Janeiro, which has provided the logistic support to the organising committee.July 26, 2002 Ruy de Queiroz

From Active Names to π-calculus Rewriting Rules

The problem of checking equivalences for π-agents is not trivial and has been widely studied in the last decade. Syntactic and semantic approaches can be taken to formally verify π-calculus equivalences. The syntactic approach rests mainly on structural congruence. On the other hand, the semantic checking methods can verify wider equivalences but cannot check infinitary π-agents. Bisimilar agents have the same set of active names. This result and a technique to check bisimulation considering active names is presented in [U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In Insup Lee and Scott A. Smolka, editors, Proceedings of CONCUR '95, volume 962 of LNCS, pages 42–56. Springer, 1995]. There, agents active names are calculated from their corresponding Labelled Transition Systems (LTS) and, because of this, cannot be directly applied to rewriting systems. In [Ana C.V. de Melo. A study on the potential active names of π-agents. ENTCS (Electronic Notes in Theoretical Computer Science) 95 (C) (apr 2004) 269–286], a syntactic characterisation of active names for π-agents was presented. Here, new rewriting rules are presented (based on the syntactic characterisation of active names) to identify and discard useless code of π-expressions for a class of expressions including composition. With these new rules, π-expressions are better reduced (more useless code is discarded) enriching the equivalence classes of agents.

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 74

This volume contains the Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT 2002). The conference was a two-day event and took place in the National University of Ireland, Galway, (NUI, Galway) on18th and 19st July, 2002.MFCSIT2002 is the second of a series of conferences to be held in Ireland whose main focus is the mathematical and foundational issues arising out of computer science and information technology. The first of these conferences, MFCSIT2000, was held at NUI, Cork on 20/21 July2000. The Proceedings were published as Volume 40 of the Electronic Notes in Theoretical Computer Science (ENTCS), (T. Hurley, M. Airchinnigh, M. Schellekens and A. Seda (eds.))The following extract from the introduction to the first conference is well worth repeating: “It is now widely recognised that there has been a very significant increase in Ireland over the last few years in activities relating to the production of software and hardware by many computer manufacturers, including some of the world's best-known names in the computer industry. However, it was felt by a number of people˙˙ that a need had emerged for a forum which could provide the means for discussion ˙˙ of related theoretical questions, and so help maintain a balance between theory and practice. The MFCSIT conferences are intended to provide such a forum and hence to help maintain this balance.”It is my pleasure to record a debt of gratitude to a considerable number of people who made the meeting the success it was, both on my own behalf and on behalf of my fellow editors: Sharon Flynn, Mícheál Mac an Airchinnigh, Niall Madden, Michael McGettrick, Michel Schellekens, and Anthony Seda.We were fortunate in having seven internationally well-known speakers who gave key-note addresses: Steve Brookes, Matthew Hennessey, Derek Holt, Peter Jeavons, Bill Lawvere, David MacKay and Mark Sofroniou. The speakers brilliantly set the themes for this conference with their fascinating and stimulating talks. We are indeed grateful to these for their participation and talks - many of the participants expressed appreciation of the quality and depth of these key-note addresses.We had two special sessions, one on Coding Theory organised by Pat Fitzpatrick, and one on Topology in Computer Science organised by Michel Schellekens and Anthony Seda. Our sincere thanks go to the organisers of these special sessions, and to the invited speakers for those sessions: Achim Jung, Mike Smyth, Dieter Spreen, David McKay, Edgar Martinez-Moro and Eimear Byrne.On the editing side, we are extremely grateful to all those who refereed the proceedings. We are particularly indebted to Niall Madden who bore the brunt of the editing and preparation of the proceedings; his expertise was invaluable.A conference cannot exist, of course, without participants, so our thanks to those who attended. (Altogether there were 57 registered participants plus a number of occasional visitors.) We are grateful also to those who submitted papers, to those who chaired sessions, and to Jimmie Browne, Registrar and Deputy-President of NUI, Galway, who opened the conference.Finally, we wish to acknowledge the following sponsors, without whose support the conference could not have taken place: Science Foundation IrelandThe Registrar's Office, NUI, GalwayThe Mathematics Department, NUI, GalwayThe Information Technology Department, NUI, GalwayThe School of Mathematics, Applied Mathematics and Statistics, NUI, CorkThe Computer Science Department, NUI, CorkSepember 19, 2003Ted Hurley

Preface: Volume 89, Issue 2

ForewordThis volume contains the proceedings of the Third International Workshop on Run-time Verification (RV '03). RV '03 was held on July 13, 2003, as a satellite workshop of the International Conference of Computer-Aided Verification (CAV '03). The first two workshops in this series were also held as satellite workshops of CAV; RV '01 was held in Paris in July 2001, and RV '02 was held in Copenhagen in July 2002.The purpose of this series of workshops has been to bring together researchers and practitioners, interested in various aspects related to the dynamic analysis of software and systems, with respect to formally specified correctness requirements. Run-time verification aims to provide a “lightweight” complement to traditional verification methods like model checking and theorem proving, by analysing an actual implementation with respect to the reduced correctness obligations of certifying the correctness of a single execution. Despite the weaker guarantees, run-time verification improves upon other more ad-hoc approaches in monitoring, by providing formal proofs.The papers selected for this year's workshop cover a wide range of topics related to runtime verification, including designing efficient and optimal verification algorithms, techniques for instrumenting programs at the source or object code/byte code level to observe program execution, developing specification languages for monitors, dynamic program analysis, and formally proving the correctness of monitoring systems. This volume includes these papers and the abstract of the Invited Presentation by the Invited Presentation by Aloysius K. Mok (University of Texas at Austin). The volume will be published in the 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/entcs.We would like to thank the Program Committee members and their reviewers, who did an excellent job evaluating the submissions and shaping the program of the workshop. We are grateful to the Steering Committee for helpful guidance and support. Special thanks go to Al Mok for agreeing to be the Invited Speaker. Thanks to the CAV '03 co-Chairs: Warren A. Hunt, Jr. (University of Texas at Austin) and Fabio Somenzi (University of Colorado at Boulder) for the opportunity to continue the tradition of having the RV workshops as CAV satellites. July 1, 2003Oleg SokolskyMahesh Viswanathan Program CommitteeSaddek BensalemVERIMAG LaboratoryRance CleavelandState University of New York at Stony BrookAnn GatesUniversity of Texas, El PasoPatrice GodefroidBell LaboratoriesGerard HolzmannNASA/JPL Laboratory for Reliable SoftwareSusan HorwitzUniversity of Wisconsin, MadisonMichael MoellerUniversity of OldenburgAloysius K. MokUniversity of Texas, AustinHenny SipmaStanford UniversityOleg SokolskyUniversity of PennsylvaniaScott StollerState University of New York at Stony BrookMahesh ViswanathanUniversity of Illinois at Urbana-ChampaignSergio YovineVERIMAG LaboratoryLenore ZuckNew York University Steering CommitteeKlaus HavelundNASA Ames Research Center - Kestrel TechnologyInsup LeeUniversity of PennsylvaniaGrigore RosuUniversity of Illinois at Urbana-Champaign

Preface: Volume 84

This volume contains the Proceedings of the 10th Workshop on Logic, Language, Information and Computation (WoLLIC'2003). The Workshop was held in Ouro Preto, Minas Gerais, Brazil from July 29 to August 1, 2003, in the Escola de Minas of the Universidade Federal de Ouro Preto (UFOP).WoLLIC is a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic. The idea is to provide a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation, and yet is small enough to allow for concrete and useful interaction among participants. Previous versions were held at: Recife (Pernambuco, Brazil) in 1994 and 1995; Salvador (Bahia, Brazil) in 1996; Fortaleza (Ceará, Brazil) in 1997; São Paulo (Brazil) in 1998; Itatiaia (Rio de Janeiro, Brazil) in 1999; Natal (Rio Grande do Norte) in 2000; Brasília (Distrito Federal, Brazil) in 2001; Rio de Janeiro (Brazil) in 2002.Scientific sponsorship comes from the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL), European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).Funding was kindly given by:(i) CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico, the scientific and technological development council of the Brazilian Ministério da Ciência e Tecnologia) (grant 450709/2003-5);(ii) CAPES (Fundação Coordenação de Apoio ao Aperfeiçoamento de Pessoal de Nível Superior, a Foundation for the Development of Higher-Education under the Brazilian Ministério da Educação e do Desporto) (grant PAEP0565/03);(iii) FAPEMIG (Fundação de Amparo à Pesquisa do Estado de Minas Gerais, the Minas Gerais state foundation for the support of scientific research);(iv) Escola de Minas da UFOP (Universidade Federal de Ouro Preto).Contributions were received in the form of short papers in all areas related to logic, language, information and computation, including:pure logical systems, proof theory, model theory, algebraic logic, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic and program semantics, logics and models of concurrency, logic and complexity theory, proof complexity, foundations of cryptography (zero-knowledge proofs), descriptive complexity, nonclassical logics, nonmonotonic logic, logic and language, discourse representation, logic and artificial intelligence, automated deduction, foundations of logic programming, logic and computation, and logic engineering.Apart from the contributed papers (15), and the invited talks (5), the programme includes 5 tutorial lectures: 1.Algorithmic Randomness and Derandomizationby Eric Allender (Department of Computer Science, Rutgers, the State University of New Jersey, USA)2.Generalized Quantifiersby Lauri Hella (Department of Mathematics, Statistics and Philosophy, University of Tampere, Finland)3.Implicit computational complexityby Jean-Baptiste Joinet (Preuves-Programmes-Systèmes, Université Paris 7, France)4.Proof search foundations for logic programmingby Dale Miller (INRIA/Futurs/Saclay, and Laboratoire d'Informatique, École Polytechnique, France)5.Iterated theory changeby Hans Rott (Institut für Philosophie, Universität Regensburg, Germany)All papers in the volume were reviewed by the program committee consisting ofMauricio Ayala-Rinóon(Departamento de Matemática, Universidade de Brasília, Brazil)Argimiro Arratia(Depto. Matematicas, Universidad Simon Bolivar, Venezuela)Alessandra Carbone(Institut des Hautes Études Scientifiques, and Université de Paris XII, France)Marcelo Coniglio(Centro de Lógica e Epistemologia, Universidade Estadual de Campinas, Brazil)Gilles Dowek(INRIA, France)Arnaud Fleury(Facoltà di Scienze, Università di Verona, Italy)Dexter Kozen(Cornell University, USA)Maarten Marx(ILLC, Faculty of Science, Universiteit Amsterdam, The Netherlands)Anto˚nio Carlos da Rocha Costa(Escola de Informática, Universidade Católica de Pelotas, Brazil)Dieter Spreen(Fachbereich Mathematik, Theoretische Informatik, Universität Siegen, Germany)Luiz Carlos Pereira(Departamento de Filosofia, PUC-Rio and UFRJ, Brazil)Jouko Väänänen(Department of Mathematics, University of Helsinki, Finland)Renata Wassermann(Departamento de Cie˚ncia da Computação, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil)The organising committee consisted ofLucília Figueiredo(Departamento de Computação, Universidade Federal de Ouro Preto, Brazil)Fred Ulisses Maranhão(Centro de Informática, Universidade Federal de Pernambuco, Brazil)Anjolina Grisi de Oliveira(Center of Informatics, Universidade Federal de Pernambuco, Brazil)Elaine Pimentel(Departamento de Matemática, Universidade Federal de Minas Gerais, Brazil) (Co-Chair)Ruy de Queiroz(Center of Informatics, Universidade Federal de Pernambuco, Brazil) (Co-Chair)Maria Angela Weiss(Departamento de Matemática, Universidade de São Paulo, Brazil)The volume will be published as volume 84 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/entcsA printed version of the current volume has been distributed to the participants at the workshop in Ouro Preto.We are very grateful to the following persons, whose help has been crucial for the success of WoLLIC'2003: Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files; Thanks are also due to the Department of Mathematics of Universidade Federal de Minas Gerais and the Department of Computing of the Universidade Federal de Ouro Preto, which has provided the logistic support to the organising committee. August 2, 2003Ruy de Queiroz, Elaine Pimentel, Lucilia Figueiredo

Preface: Volume 85, Issue 7

Preface: Volume 85, Issue 7

Preface: Volume 82, Issue 1

This volume contains the Proceedings of the Sixth Workshop on Coalgebraic Methods in Computer Science (CMCS'03). The workshop was held in Warsaw, Poland on April 5 and 6, 2003, as a satellite event to the European Joint Conference on Theory and Practice of Software (ETAPS'03). The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras and its applications. Previous workshops have been organized in Lisbon (1998), Amsterdam (1999), Berlin (2000), Genoa (2001), and Grenoble (2002).Coalgebras have been found extremely useful for capturing state-based dynamical systems, such as transition systems, automata, process calculi, and class-based systems. The theory of coalgebras has developed into a field of its own interest, presenting a deep mathematical foundation, a growing domain of applications and interactions with various other fields, such as reactive and interactive systems theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc.The program committee of CMCS'03 consisted ofJiri AdámekTechnical University of Braunschweig, GermanyCorina CîrsteaOxford University, UKH. Peter GummUniversity of Marburg, Germany, (chair)Bart JacobsUniversity of Nijmwegen, The NetherlandsAlexander KurzUniversity of Leicester, UKMarina LenisaUniversity of Udine, ItalyUgo MontanariUniversity of Pisa, ItalyLarry MossIndiana University, Bloomington, USAAtaru T. NakagawaSoftware Research Associates, Tokyo, JapanHorst ReichelTechnical University Dresden, GermanyGrigore RosuUniversity of Illinois, Urbana, USAJan RuttenCWI, Amsterdam, The NetherlandsJames WorrellTulane University, New Orleans, USAThe papers were refereed by the program committee and by several outside referees, whose help is gratefully acknowledged. The invited speakers at the conference wereZoltán ÉsikUniversity of Szeged, HungaryVaughan PrattStanford University, USAThese proceedings are being published as volume 82.1 in the series Electronic Notes in Theoretical Computer Science (ENTCS). Printed copies, containing preliminary versions of the articles in these proceedings were distributed to the participants of the conference. The proceedings of the previous CMCS workshops appeared as ENTCS Volumes 11, 19, 33, 44.1, and 65.1.We are grateful to ENTCS for their continuing support, in particular to Mike Mislove, Managing Editor of the ENTCS series.For the sixth time, CMCS has been organized as satellite event to ETAPS. We are very grateful to the ETAPS organizers, especially to Damian Niwinski, for taking care of all the local organization and for accommodating all our special requests. Marburg, May 27, 2003H. Peter Gumm

Preface: Volume 82, Issue 5

SC 2003: Workshop on Software Composition Affiliated with ETAPS 2003Warsaw, Poland, April 6th, 2003This volume contains the Proceedings of the Second Workshop on Software Composition (SC 2003). The Workshop has been held in Warsaw, Poland on April 6th, 2003, as a satellite event of ETAPS 2003.The aim of the SC Workshop is to collect different approaches and experiences in the domain of software composition. Component-based approaches to produce software from smaller units attract increasing attention of both research and industry. The rational behind this trend is in the promise of reuse. This is the idea to produce software by “plug & play” components which already exist or are produced by different external vendors. Components and software composition are considered to be a new way to overcome the remaining problems (e.g. reusability, deal with complexity) still not solved by the object-oriented paradigm.In this context, the SC workshop collects different approaches and experiences to explore and overcome the gap between promise and reality. The goal is to demystify these new approaches based on components and instead elaborate the real advantages, problems and challenges.The papers in this issue have been reviewed by the following Program Committee Members: •Uwe Assmann, Linköpings Universitet, Sweden, http://www.ida.liu.se/~uweas•Elke Pulvermueller, Universitaet Karlsruhe, Germany•Isabelle Borne, Université de Bretagne-Sud, France•Noury Bouraqadi, Ecole des Mines de Douai, France•Pierre Cointe, Ecole des Mines de Nantes, France•Zoltan Laslo, Budapest University of Technology and Economics, Hungary http://www.fsz.bme.hu/staff/laszlo/•Welf Loewe, Växjö Universitet, Sweden http://www.masda.vxu.se/~wlo/index.en.htm•M. Awais Rashid, Lancaster University, UK http://www.comp.lancs.ac.uk/computing/users/marash•Benedikt Schulz, Forschungszentrum Informatik Karlsruhe, Germany•Mario Suedholdt, École des Mines de Nantes, France http://www.emn.fr/sudholt/•Bedir Tekinerdogan, University of Twente, The Netherlands•Arnd Poetzsch-Heffter, Universität Kaiserslautern, Germany http://softech.informatik.uni-kl.de/mitarbeiter/poetzsch.htmlThis volume will be published 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 URL :http://www.elsevier.nl/locate/entcshttp://math.tulane.edu/~entcsWe thank all persons contributing to the success of SC2003: the authors, participants, PC Members, the ETAPS organisers and the ENTCS editors.This workshop was partially funded by the EC in the context of the project EASYCOMP (IST 1999-14191).

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 55, Issue 1

This volume contains the Proceedings of the First Workshop on Logical Aspects of Cryptographic Protocol Verification (LACPV'2001), held in Paris, France, July 23, 2001 as a satellite workshop of CAV'01.Security of computer systems is a growing field of concerns. While security in the large is quite a large and daunting field, the study of cryptographic protocols has received renewed interest in recent years, mostly because of the emergence of electronic commerce. The focus in cryptographic protocols, as opposed to mere cryptography, is the interaction of cryptographic primitives with message exchanges and possible malevolent actions from intruders. Most of the discovered bugs in cryptographic protocols are not so much tied to subtleties in cryptography, rather to logical aspects of interactions between principals.From a protocol-oriented point of view, cryptographic protocols pose new challenges: there may be an unbounded number of principals (processes in parallel), state spaces are infinite even with bounded numbers of principals, and so on. Several models exist that handle the complexity of cryptographic protocol verification, based on process calculi, first-order logic, automata theory, complexity theory among others.As such, cryptographic protocol verification is emerging as a research field in its own right, strongly linked to logic. The purpose of the LACPV workshop is to bring together researchers in the field of cryptographic protocol verification to share new results in the field. Domains of interest include formal relationships between models of cryptographic protocols, translations, expressive power; comparison between verification methods, accuracy, efficiency; fragments of first-order logic or extensions corresponding to various problems of interest in cryptographic protocol verification; decidability and complexity of cryptographic verification problems, reachability, decidable subcases; new logics and calculi for verifying cryptographic protocols; new approaches to reduce state spaces from infinite to finite; logical characterizations of confidentiality/secrecy, authentication/integrity, non-duplication, non-repudiation, etc.Three invited talks, by Y. Lakhnech, M. Rusinowitch, and R. Amadio, plus five submitted papers out of ten were selected for presentation at LACPV'2001. They were reviewed by the program committee consisting, besides editor, of Hubert ComonLSV, ENS CachanMourad DebbabiUniversité Laval, QuébecJon MillenComputer Science Lab, SRI InternationalScott StollerState University of New York, Stony BrookThis volume will be published as volume 55, issue 1, 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/entcsA printed version of the current volume is distributed to the participants at the workshop in Paris.We are very grateful to the following persons, whose help has been crucial for the success of LACPV'2001: Alain Finkel for his help in managing CAV satellite workshops; Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files.July 05, 2001Jean Goubault-Larrecq

Preface: Volume 70, Issue 2

This issue contains the Proceedings of the Third International Workshop on Logical Frameworks and Meta-Languages (LFM 2002). The workshop was held in Copenhagen, Denmark on July 26, 2002 as a FLoC'02 affiliated workshop, sponsored by the CADE and LICS conferences.Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation has been the focus of considerable research over the last two decades, using competing and sometimes incompatible basic principles. This workshop brings together designers, implementors, and practitioners to discuss all aspects of logical frameworks.The papers in this volume were selected by the following program committed, although not formally refereed. David Basin,University of FreiburgThierry Coquand,Göteborg UniversityAmy Felty,University of OttawaDidier Galmiche,LORIA NancyDale Miller,Penn State UniversityTobias Nipkow,Technical University MunichFrank Pfenning (chair),Carnegie Mellon UniversityBenjamin Pierce,University of PennsylvaniaBenjamin Werner,INRIA RocquencourtPapers were revised after the workshop before inclusion in these proceedings, which will be published as Volume 70, Issue 2 in the series Electronic Notes in Theoretical Computer Science (ENTCS). It can be accessed via the URLhttp://www.elsevier.nl/locate/entcs/volume70.htmlDecember 9, 2002Frank Pfenning

Preface: Volume 70, Issue 3

This volume contains the Proceedings of the REFINE 2002 workshop. The Workshop was held in Copenhagen, Denmark on July 20 and 21, 2002, as a satellite event to FLoC'02 as an FME-affiliated workshop.Refinement is one of the cornerstones of a formal approach to software engineering. Refinement is the process of developing a more detailed design or implementation from an abstract specification through a sequence of mathematically-based steps that maintain correctness with respect to the original specification.The aim of this BCS FACS refinement workshop was to bring together people who are interested in the development of more concrete designs or executable programs from abstract specifications using formal notations, tool support for formal software development, and practical experience with formal refinement methodologies.The purpose of the workshop was to provide a forum for discussion of common ground and key differences. Topics of interest included: •Simulation techniques•Foundations and semantics•Case studies (specification and verification)•Compositional and modular reasoning•Object-orientation•Time•Specification notations•Programming models•Verification and tool supportThe workshop continued a long tradition of refinement workshops run under the auspices of the British Computer Society (BCS) FACS special interest group. Running since 1988, previous refinement workshops have been held at Cambridge, London, Bath etc.In 1998 the BCS refinement workshop was combined with the Australasian Refinement Workshop to form the International Refinement Workshop, hosted at alongside Formal Methods Pacific 1998 at The Australian National University.The papers in this volume were reviewed by a small program committee consisting of •John Derrick<jd1@ukc.ac.uk, University of Kent, UK.•Eerke Boiten<eab2@ukc.ac.uk, University of Kent, UK.•Jim Woodcock<jcpw@ukc.ac.uk, University of Kent, UK.•Joakim von Wright<jockum.wright@abo.fi, Åbo Akademi University, FinlandAdditional information about the Workshop can be found at: http://www.cs.ukc.ac.uk/people/staff/eab2/refine/floc.htmlThis volume will be published as volume 70 issue 3 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 URLhttp://www.elsevier.nl/locate/entcsA printed version of the current volume was distributed to the participants at the workshop in Denmark.We are very grateful to the following persons, whose help has been crucial for the success of REFINE 2002: Lars-Henrik Eriksson and Peter Lindsay of FME for their help with the organization of the Workshop as satellite event of FLoC'02 and an FME affiliated workshop; Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files. Thanks are also due to the Computing Laboratory of the University of Kent, which supplied financial support to cover the printing costs.July 24, 2002John Derrick

Preface: Volume 67

This volume contains the Proceedings of the 9th Workshop on Logic, Language, Information and Computation (WoLLIC'2002). The Workshop was held in Rio de Janeiro, Brazil from July 30 to August 2, 2002, in the campus of the Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio).WoLLIC is a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation, and yet is small enough to allow for concrete and useful interaction among participants. Previous versions were held at: Recife (Pernambuco, Brazil) in 1994 and 1995; Salvador (Bahia, Brazil) in 1996; Fortaleza (Ceará, Brazil) in 1997; São Paulo (Brazil) in 1998; Itatiaia (Rio de Janeiro, Brazil) in 1999; Natal (Rio Grande do Norte) in 2000; Brasília (Distrito Federal, Brazil) in 2001. [new] Scientific sponsorship comes from the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).[end new] Scientific sponsorship comes from the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Association for Symbolic Logic (ASL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). Funding was kindly given by: (i) CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico, the scientific and technological development council of the Brazilian Ministério da Ciência e Tecnologia) (grant 451491/2002-5); (ii) CAPES (Fundação Coordenação de Apoio ao Aperfeiçoamento de Pessoal de Nível Superior, a Foundation for the Development of Higher-Education under the Brazilian Ministério da Educação e do Desporto) (grant PAEP0169/02-1); (iii) PUC-Rio (Pontifícia Universidade Católica do Rio de Janeiro). Contributions were received in the form of short papers in all areas related to logic, language, information and computation, including: pure logical systems, proof theory, model theory, algebraic logic, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic and program semantics, logics and models of concurrency, logic and complexity theory, proof complexity, foundations of cryptography (zero-knowledge proofs), descriptive complexity, nonclassical logics, nonmonotonic logic, logic and language, discourse representation, logic and artificial intelligence, automated deduction, foundations of logic programming, logic and computation, and logic engineering.Apart from the contributed papers (14), and the invited talks (6), the programme includes 6 tutorial lectures: •Some model theory of ordered structures by Ricardo Bianconi (Departamento de Matemática Pura, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil)•Computing with Real Numbers by Felipe Cucker (Department of Mathematics, City University of Hong Kong, People's Republic of China)•Model Checking Games by Erich Grädel (Mathematische Grundlagen der Informatik, RWTH Aachen, Germany)•The Metalanguage Lambda Prolog and its Implementation by Gopalan Nadathur (University of Minnesota, USA)•Automata theory and logic by Igor Walukiewicz (Bordeaux University, France)•States of Knowledge (Tutorial) by Rohit Parikh (Department of Computer and Information Science, Brooklyn College, City University of New York, USA)All papers in the volume were reviewed by the program committee consisting, besides editor, of Mauricio Ayala-Rincón(Department of Mathematics, Universidade de Brasília, Brazil)Mario Benevides(Institute of Mathematics, Universidade Federal do Rio de Janeiro, Brazil)Anuj Dawar(Computer Laboratory, Cambridge University, England)Philippe de Groote(LORIA, France)Roger Maddux(Department of Mathematics, Iowa State University, USA)Toniann Pitassi(Department of Computer Science, Toronto University, Canada)Bruno Poizat(Institut Girard Desargues, Université Claude Bernard Lyon I, France)Alberto Policriti(Department of Mathematics and Informatics, Università di Udine, Italy)Glynn Winskel(Computer Laboratory, Cambridge University, England)The organising committee consisted, besides editor, of Edward Hermann Haeusler(Department of Informatics, Pontifícia Universidade Católica do Rio de Janeiro, Brazil)Claus Akira Matsushigue(Institute of Mathematics and Statistics, Universidade de São Paulo, Brazil)Anjolina Grisi de Oliveira(Center of Informatics, Universidade Federal de Pernambuco, Brazil)Luiz Carlos Pereira(Department of Philosophy, Pontifícia Universidade Católica do Rio de Janeiro, Brazil)Ruy de Queiroz(Center of Informatics, Universidade Federal de Pernambuco, Brazil)Jorge Petrúcio Viana(Coordination of Postgraduate Programmes in Engineering and Systems, Universidade Federal do Rio de Janeiro, Brazil)The volume will be published as volume 67 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/entcsA printed version of the current volume is distributed to the participants at the workshop in Rio de Janeiro.We are very grateful to the following persons, whose help has been crucial for the success of WoLLIC'2002: Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files; Thanks are also due to the Departments of Philosophy and Informatics of the Pontifícia Universidade Católica of Rio de Janeiro, which has provided the logistic support to the organising committee.July 26, 2002 Ruy de Queiroz

Preface: Volume 65, Issue 3

ForewordThis is the second edition of the Workshop on Language Descriptions, Tools, and Applications (LDTA). Theme of this workshop is the description of (programming) languages and the development and/or generation of tools for these languages based on formal descriptions. The aim of this workshop is to bring together researchers from academia and industry interested in the formal definition of languages, and the use of these definitions for the derivation of tools and software applications (e.g., interactive transformation tools, software renovation tools, application generators). The contributions for this workshop are based on all kinds and styles of formal language definition including attribute grammars, algebraic approaches, action semantics, operational semantics, and denotational semantics. Many aspects of the definition of languages, and the derivation of tools and applications are independent of the actual formalism used. The workshop also welcomes contributions to compare formalisms or to discuss the benefits and drawbacks of specific formalisms.The LDTA 2002 program consists of 6 regular peer-reviewed papers, which were selected from 14 submissions, one invited talk by Charles Consel on “Domain-Specific Languages: What, Why, How”, and 4 invited tool demonstrations. The selected papers cover a broad range of themes like: applying rewriting strategies to build interpreters, program slicing based on XML, application of aspect oriented programming and XML, multi-lingual bibliography tooling, and incremental attribute evaluators. The tool demonstrations are concerned with presentations of the new ELAN environment, an environment for action semantics, the Grammar Deployment Kit (GDK), and the ELI system.This volume will be published as volume 65-3 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 would like to thank the program committee members for their help in evaluating the papers and making a scientifically interesting selection. Furthermore, we would like to thank the ETAPS organizing committee for taking care of the local organization of our workshop. We are very pleased that these proceedings are published in the Electronic Notes in Theoretical Computer Science (ENTCS) by Elsevier, which increases the visibility of the LDTA workshop.Organizing CommitteeGorel Hedin(Lund Institute of Technology, Lund, Sweden)Marjan Mernik(University of Maribor, Maribor, Slovenia)Didier Parigot(INRIA, Sophia Antipolis, France)Program CommitteeMark van den Brand(CWI, Amsterdam, The Netherlands)Barrett R. Bryant(University of Alabama, Birmingham, USA)Katsuhiko Gondow(JAIST, Japan)Ralf Lämmel(Vrije Universiteit Amsterdam, The Netherlands)Jan Heering(CWI, Amsterdam, The Netherlands)Oege de Moor(Oxford University Computing Laboratory, Great Britain)Pierre-Etienne Moreau(INRIA/LORIA, Nancy, France)Peter D. Mosses(BRICS, Aarhus, Denmark)Joao Saraiva(University of Minho, Portugal)David Watt(University of Glasgow, Great Britain)

Preface: Volume 65, Issue 6

This volume contains the Proceedings of the First Workshop on the Theory and Practice of Timed Systems (TPTS'2002). The Workshop was held in Grenoble, France on April 6 and 7, 2002, as satellite event to ETAPS'2002.The study of time-dependent behavior is treated currently under different titles by different communities. Classical problems of manufacturing scheduling, for example, are considered as part of operation research and industrial engineering. Similar but different scheduling problems are encountered in the research on real-time operating systems. People who are interested in semantics, verification or performance analysis are working on models such as timed automata, timed Petri nets or max-plus algebra. Electrical engineers have to consider propagation delays in their circuits and designer of embedded controllers have to take into account the time it takes for the controller to compute its reaction after sampling the environment. The unifying theme underlying all these apparently different domains is that they treat systems whose behavior depends upon combinations of logical and temporal constraints, i.e. constraints on the distance between the occurrences of two events.The workshop goal is to promote the study of fundamental and practical aspects of timed systems. The three major axes of interest are listed below: Foundations and semantics: contributions to a better theoretical foundations for timed systems and timed formal languages as well as a comparison between different models used by different communities (timed automata, timed Petri nets, max-plus algebra, etc.).Algorithms and tools: new algorithms and data-structures for analyzing timed systems and resolving temporal constraints. are needed in order to push timing technology into the real world.Applications: adaptation and specialization of timing technology to the modeling and analysis of certain types of application domains in which timing plays an important role (real-time software, hardware circuits and problems of scheduling in manufacturing or telecommunication).The papers in this volume were reviewed by the program committee consisting of Rajeev Alur(U. Penn, Philadelphia)Eugene Asarin(Verimag, Grenoble)Ahmed Bouajjani(LIAFA, Paris)Jordi Cortadella(U. Catalunya, Barcelona)Sebastian Engell(U. of Dortmund)Tom Henzinger(U. California, Berkeley)Bengt Jonsson(U. of Uppsala)Kim Larsen(U. of Aalborg)Insup Lee(U. Penn, Philadelphia)Oded Maler(Verimag, Grenoble)Chris Myers(U. Utah, Salt Lake City)Peter Niebert(U. Provence, Marseille)Antoine Petit(ENS, Cachan)Paul Petterson(U. of Uppsala)Amir Pnueli(Weizmann Institute, Rehovot)Alex Rabinovich(U. of Tel-Aviv)Jean-Francois Raskin(Free University, Brussels)Karem Sakallah(U. Michigan, Ann Arbor)Ken Stevens(Intel, Hillsboro)Wang Yi(U. of Uppsala)Sergio Yovine(Verimag, Grenoble)This volume will be published as volume 65, issue 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 URLMarch 18, 2002 Eugene Asarin, Oded Maler, Sergio Yovine

Preface: Volume 63

This volume contains the Proceedings of the First Workshop on Security of Mobile Multiagent Systems (SEMAS'2001). The Workshop was held in Montreal, Canada on May 29, 2001, as satellite event to the 5th International Conference on Autonomous Agents 2001The far reaching influence of the Internet has resulted in an increased interest in agent technologies, which are poised to play a key role in the implementation of successful Internet and WWW-based applications in the future. While there is still considerable hype concerning agent technologies, there is also an increasing awareness of the problems involved. Although there is a large body of work on cryptographic techniques that provide basic building-blocks to solve specific security problems, relatively little work has been done in investigating security in the multiagent system context. The introduction of mobile software agents significantly increases the risks involved in Internet and WWW-based applications. The aim of this workshop was to bring together people from the two relevant research fields, software security and agent-oriented programming. This volume covers actual research papers on security protocols and security policies to enforce security of mobile or multiagent systems but also introduces ideas how to use mobile agents to ensure security of a distributed system.The papers in this volume were reviewed by the program committee consisting, besides editor, of Sahin Albayrak(Technical University Berlin)David Basin(Department of Computer Science, University of Freiburg)Ciaran Bryce(University of Geneve)Hans-Juergen Buerckert(German Research Center for Artificial Intelligence, DFKI)Guenther Karjoth(IBM Research Zuerich)Luc Moreau(Department of Computer Science, University of Southhampton)Volker Roth(Fraunhofer Gesellschaft IGD, Darmstadt)Helmut Schwigon(Bundesamt fuer Sicherheit in der Informationstechnik, BonnVipin Swarup(The MITRE Corp., Boston)Christian Tschudin(Uppsala University)Jan Vitek(Purdue University)This volume will be published as volume 63 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 following persons, whose help has been crucial for the success of CMCS'2000: Adele E. Howe, for her help with the organization of the Workshop as satellite event of AA'2001 and Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files.December 15, 2001 Dieter Hutter

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 4

This volume contains the Proceedings of the First Workshop on Software Composition (SC 2002). The Workshop has been held in Grenoble, France on April 7th, 2001, as a satellite event of ETAPS 2002.The aim of the SC Workshop is to collect different approaches and experiences in the domain of software composition. Component-based approaches to produce software from smaller units attract increasing attention of both research and industry. The rational behind this trend is in the promise of reuse. This is the idea to produce software by “plug & play” components which already exist or are produced by different external vendors. Components and software composition are considered to be a new way to overcome the remaining problems (e.g. reusability, deal with complexity) still not solved by the object-oriented paradigm.In this context, the SC workshop collects different approaches and experiences to explore and overcome the gap between promise and reality. The goal is to demystify these new approaches based on components and instead elaborate the real advantages, problems and challenges.The papers in this issue have been reviewed by the following Program Committee Members: •Uwe Assmann, Linköpings Universitet, Sweden•Pierre Cointe, Ecole des Mines de Nantes, France•Isabelle Borne, Ecole des Mines de Nantes, France•Noury Bouraqadi, Ecole des Mines de Douai, France•Serge Demeyer, University of Antwerp, Belgium•Zoltan Laszlo, Budapest University of Technology and Economics, Hungary•Welf Loewe, Universitaet Karlsruhe, Germany•Mira Mezini, Darmstadt University of Technology, Germany•Arnd Poetzsch-Heffter, FernUniversitaet Hagen,•Elke Pulvermueller, Universitaet Karlsruhe, Germany•M. Awais Rashid, Lancaster University, UK•Benedikt Schulz, Forschungszentrum Informatik Karlsruhe, Germany•Andreas Speck, Intershop Research, Jena, Germany•Mario Südholt, Ecole des Mines de Nantes, France•Bedir Tekinerdogan, University of Twente, The NetherlandsThis volume will be published 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 URL: http://www.elsevier.nl/locate/entcshttp://math.tulane.edu/~entcsWe thank all persons contributing to the success of SC2002: the authors, participants, PC Members, the ETAPS organisers and the ENTCS editors.This workshop was partially funded by the EC in the context of the project EASYCOMP (IST 1999-14191).

Preface: Volume 52, Issue 1

This volume contains the Proceedings of the Eighth International Workshop on Expressiveness in Concurrency (EXPRESS'01). The Workshop was held in Aalborg, Denmark on August 20, 2001, as satellite event to CONCUR 2001.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. The EXPRESS'00 workshop was again held as a satellite workshop of CONCUR 2000, Pennsylvania State University, USA, co-chaired by Luca Aceto and Björn Victor.The papers in this volume were reviewed by the program committee consisting, besides the editors, of Franck van Breugel(Department of Computer Science, York University)Ilaria Castellani(INRIA, Sophia-Antipolis)Rance Cleaveland(Department of Computer Science, SUNY at Stony Brook)Philippa Gardner(Department of Computing, Imperial College)Jan Friso Groote(Department of Computer Science, Eindhoven University of Technology)Faron Moller(Department of Computer Science, University of Wales Swansea)Joachim Parrow(KTH Teleinformatik, Royal Institute of Technology)Julian Rathke(School of Cognitive and Computing Sciences, University of Sussex)Roberto Segala(Dipartimento di Informatica, Università di Verona)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/entcsWe are very grateful to the following persons, whose help has been crucial for the success of EXPRESS'01: Hans Hüttel and Anna Ingólfsdóttir for their help with the organization of the Workshop as satellite event of CONCUR 2001; Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files; Uffe Engberg for his great help in the production of the preliminary version of these Proceedings for distribution at the Workshop. Thanks are also due to BRICS (Basic Research in Computer Science), a centre of the Danish National Research Foundation, which has supplied financial support to cover the printing costs.December 20, 2001Luca Aceto and Prakash Panangaden