Search

Kim Marriott Bernd Meyer Communication is one of the hallmarks of humans. When we think of hu­ man communication, most people first think of spoken and written lan­ guages. These are similar in that symbols in the language are encountered and processed sequentially, either temporally as they are spoken or as char­ acters are read across a page. However, not all human communication is sequential in nature. Important components of human communication are visual languages, such as maps or diagrams. In these languages the basic symbols are not encountered sequentially but rather seen together at a glance. Visual languages are ubiquitous in human cultures, ranging from tradi­ tional paintings of central Australian aborigines which are, in part, maps of the countryside to an architect's design of a new building. Visual languages have been employed from earliest pre-history to the present and are used in almost every human endeavor. They cover the entire spectrum of human expression ranging from fine art, such as an abstract expressionist's private language, to precise technical communication using rigorously defined no­ tation, such as musical notation, mathematical notation, or street maps. Some visual languages, such as sign languages used by the deaf community, substitute spoken language entirely. Indeed, sign languages, for example American Sign Language, are a particularly interesting instance of visual communication, since they use three-dimensional spatial arrangements of signs in combination with their sequential temporal order to constitute meaning.

In 1996 the International Federation for Information Processing (IFIP) establ- hed its rst Technical Committee on foundations of computer science, TC1. The aim of IFIP TC1 is to support the development of theoretical computer science as a fundamental science and to promote the exploration of fundamental c- cepts, models, theories, and formal systems in order to understand laws, limits, and possibilities of information processing. This volume constitutes the proceedings of the rst IFIP International C- ference on Theoretical Computer Science (IFIP TCS 2000) { Exploring New Frontiers of Theoretical Informatics { organized by IFIP TC1, held at Tohoku University, Sendai, Japan in August 2000. The IFIP TCS 2000 technical program consists of invited talks, contributed talks, and a panel discussion. In conjunction with this program there are two special open lectures by Professors Jan van Leeuwen and Peter D. Mosses. The decision to hold this conference was made by IFIP TC1 in August 1998, and since then IFIP TCS 2000 has bene ted from the e orts of many people; in particular, the TC1 members and the members of the Steering Committee, the Program Committee, and the Organizing Committee of the conference. Our special thanks go to the Program Committee Co-chairs: Track (1): Jan van Leeuwen (U. Utrecht), Osamu Watanabe (Tokyo Inst. Tech.) Track (2): Masami Hagiya (U. Tokyo), Peter D. Mosses (U. Aarhus).

This book constitutes the refereed proceedings of the 10th International Workshop on Abstract State Machines, ASM 2003, held in Taormina, Italy in March 2003. The 16 revised full papers presented together with 8 invited papers and 12 abstracts were carefully reviewed and selected for inclusion in the book. The papers reflect the state of the art of the abstract state machine method for the design and analysis of complex software/hardware systems. Besides theoretical results and methodological progress, application in various fields are studied as well.

The ASM 2000 workshop was held in the conference center of the Swiss Federal Institute of Technology (ETH) at Monte Verit a, Canton Ticino, March 19-24, 2000. The ASM formalism was proposed together with the thesis that it is suitable to model arbitrary computer systems on arbitrary abstraction levels. ASMs have been successfully used to analyze and specify various hardware and software systems including numerous computer languages. The aim of the workshop was to bring together domain-experts, using ASMs as a practical speci cation method, and theorists working with ASMs and related methods. In addition the workshop served as a forum on theoretical and practical topics that relate to ASMs in a broad sense. Three tutorials including hands-on experience with tools were organized by U. Gl¨asser and G. del Castillo (on the topic \Specifying Concurrent Systems with ASMs'), H. Russ ¨ and N. Shankar (on the topic \A Tutorial Introduction to PVS'), M. Anlau, P.W. Kutter, and A. Pierantonio (on the topic \Developing Domain Speci c Languages'). In response to the organization committee's call for papers, 30 papers were submitted, each of which was independently reviewed by four members of the program committee. This volume presents a selection of 12 of the refereed papers and two reports on industrial ASM application at Siemens AG and Microsoft Research, together with contributions based on the invited talks given by A.

Adaptive Agents and Multi-Agent Systems is an emerging and exciting interdisciplinary area of research and development involving artificial intelligence, computer science, software engineering, and developmental biology, as well as cognitive and social science. This book surveys the state of the art in this emerging field by drawing together thoroughly selected reviewed papers from two related workshops; as well as papers by leading researchers specifically solicited for this book. The articles are organized into topical sections on - learning, cooperation, and communication - emergence and evolution in multi-agent systems - theoretical foundations of adaptive agents

The objective of program analysis is to automatically determine the p- perties of a program. Tools of software development, such as compilers, p- formance estimators, debuggers, reverse-engineering tools, program veri?- tion/testing/proving systems, program comprehension systems, and program specializationtoolsarelargelydependentonprogramanalysis. Advancedp- gram analysis can: help to?nd program errors; detect and tune performan- critical code regions; ensure assumed constraints on data are not violated; tailor a generic program to suit a speci?c application; reverse-engineer so- ware modules, etc. A prominent program analysis technique is symbolic a- lysis, which has attracted substantial attention for many years as it is not dependent on executing a program to examine the semantics of a program, and it can yield very elegant formulations of many analyses. Moreover, the complexity of symbolic analysis can be largely independent of the input data size of a program and of the size of the machine on which the program is being executed. In this book we present novel symbolic control and data?ow repres- tation techniques as well as symbolic techniques and algorithms to analyze and optimize programs. Program contexts which de?ne a new symbolic - scription of program semantics for control and data?ow analysis are at the center of our approach. We have solved a number of problems encountered in program analysis by using program contexts. Our solution methods are e?cient, versatile, uni?ed, and more general (they cope with regular and irregular codes) than most existing methods.

Over the past three decades, software engineers have derived a progressively better understanding of the characteristics of complexity in software. It is now widely recognised thatinteraction is probably the most important single char- teristic of complex software. Software architectures that contain many dyna- cally interacting components, each with their own thread of control, and eng- ing in complex coordination protocols, are typically orders of magnitude more complex to correctly and e?ciently engineer than those that simply compute a function of some input through a single thread of control. Unfortunately, it turns out that many (if not most) real-world applications have precisely these characteristics. As a consequence, a major research topic in c- puter science over at least the past two decades has been the development of tools and techniques to model, understand, and implement systems in which interaction is the norm. Indeed, many researchers now believe that in future computation itself will be understood as chie?y a process of interaction.

Program construction is about turning specifications of computer software into implementations. Recent research aimed at improving the process of program construction exploits insights from abstract algebraic tools such as lattice theory, fixpoint calculus, universal algebra, category theory, and allegory theory.This textbook-like tutorial presents, besides an introduction, eight coherently written chapters by leading authorities on ordered sets and complete lattices, algebras and coalgebras, Galois connections and fixed point calculus, calculating functional programs, algebra of program termination, exercises in coalgebraic specification, algebraic methods for optimization problems, and temporal algebra.

This book is based on material presented at the international summer school on Applied Semantics that took place in Caminha, Portugal, in September 2000. We aim to present some recent developments in programming language research, both in semantic theory and in implementation, in a series of graduate-level lectures. The school was sponsored by the ESPRIT Working Group 26142 on Applied Semantics(APPSEM),whichoperatedbetweenApril1998andMarch2002.The purpose of this working group was to bring together leading reseachers, both in semantic theory and in implementation, with the speci?c aim of improving the communication between theoreticians and practitioners. TheactivitiesofAPPSEMwerestructuredintonineinterdisciplinarythemes: A: Semantics for object-oriented programming B: Program structuring C: Integration of functional languages and proof assistants D: Veri?cation methods E: Automatic program transformation F: Games, sequentiality, and abstract machines G: Types and type inference in programming H: Semantics-based optimization I: Domain theory and real number computation These themes were identi?ed as promising for pro?table interaction between semantic theory and practice, and were chosen to contribute to the following general topics: – description of existing programming language features; – design of new programming language features; – implementation and analysis of programming languages; – transformation and generation of programs; – veri?cation of programs. The chapters in this volume give examples of recent developments covering a broad range of topics of interest to APPSEM.

The First CADE in the Third Millennium This volume contains the papers presented at the Eighteenth International C- ference on Automated Deduction (CADE-18) held on July 27–30th, 2002, at the University of Copenhagen as part of the Federated Logic Conference (FLoC 2002). Despite a large number of deduction-related conferences springing into existence at the end of the last millennium, the CADE conferences continue to be the major forum for the presentation of new research in all aspects of automated deduction. CADE-18 was sponsored by the Association for Auto- ted Reasoning, CADE Inc., the Department of Computer Science at Chalmers University, the Gesellschaft fur ¨ Informatik, Safelogic AB, and the University of Koblenz-Landau. There were 70 submissions, including 60 regular papers and 10 system - scriptions. Each submission was reviewed by at least?ve program committee members and an electronic program committee meeting was held via the Int- net. The committee decided to accept 27 regular papers and 9 system descr- tions. One paper switched its category after refereeing, thus the total number of system descriptions in this volume is 10. In addition to the refereed papers, this volume contains an extended abstract of the CADE invited talk by Ian Horrocks, the joint CADE/CAV invited talk by Sharad Malik, and the joint CADE-TABLEAUX invited talk by Matthias Baaz. One more invited lecture was given by Daniel Jackson.

This volume contains the papers presented at the 19th International Conference on Automated Deduction (CADE-19) held 28 July–2 August 2003 in Miami Beach, Florida, USA. They are divided into the following categories: – 4 contributions by invited speakers: one full paper and three short abstracts; – 29 accepted technical papers; – 7 descriptions of automated reasoning systems. These proceedings also contain a short description of the automated theor- proving system competition (CASC-19) organized by Geo? Sutcli?e and Chr- tian Suttner. Despite many competing smaller conferences and workshops covering di?- entaspectsofautomateddeduction,CADEisstillthemajorforumfordiscussing new results on all aspects of automated deduction as well as presenting new s- tems and improvements of established systems. In contrast to the previous year, when CADE was one of the conferences participating in the Third Federated Logic Conference (FLoC 2002), and next year, when CADE will be part of the Second International Joint Conference on Automated Reasoning (IJCAR 2004), CADE-19 was organized as a stand-alone event.

CASL, the Common Algebraic Specification Language, was designed by the members of CoFI, the Common Framework Initiative for algebraic specification and development, and is a general-purpose language for practical use in software development for specifying both requirements and design. CASL is already regarded as a de facto standard, and various sublanguages and extensions are available for specific tasks. This book illustrates and discusses how to write CASL specifications. The authors first describe the origins, aims and scope of CoFI, and review the main concepts of algebraic specification languages. The main part of the book explains CASL specifications, with chapters on loose, generated and free specifications, partial functions, sub- and supersorts, structuring specifications, genericity and reusability, architectural specifications, and version control. The final chapters deal with tool support and libraries, and present a realistic case study involving the standard benchmark for comparing specification frameworks. The book is aimed at software researchers and professionals, and follows a tutorial style with highlighted points, illustrative examples, and a full specification and library index. A separate, complementary LNCS volume contains the CASL Reference Manual.

ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

ETAPS 2002 was the?fth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998by combining a number of existing and new conferences. This year it comprised 5 conferences (FOSSACS, FASE, ESOP, CC, TACAS), 13 satellite workshops (ACL2, AGT, CMCS, COCV, DCC, INT, LDTA, SC, SFEDL, SLAP, SPIN, TPTS, and VISS), 8invited lectures (not including those speci?c to the satellite events), and several tutorials. The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

This book constitutes the refereed proceedings of the 12th International Conference on Compiler Construction, CC 2003, held in Warsaw, Poland, in April 2003. The 20 revised full regular papers and one tool demonstration paper presented together with two invited papers were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on register allocation, language constructs and their implementation, type analysis, Java, pot pourri, and optimization.

ETAPS2000 was the third instance of the EuropeanJoint Conferenceson Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS),?ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

Deployment is the act of taking components and readying them for productive use. There may be steps following deployment, such as installation or m- agement related functions, but all decisions about how to con?gure and c- pose/assemble a component are made at the deployment stage. This is therefore the one opportunity in the software lifecycle to bridge the gap between what the component developer couldn't know about the deployment environment and what the environment's developer couldn't know about the open set of depl- able components. It is not surprising that deployment as a dedicated step gains importance when addressing issues of system-wide qualities, such as coping with constrained resources or preparing for component adaptation and system evolution. Yet, component deployment is still a discipline in its infancy: it became mainstream practice only in the mid 1990s. Much of the best practice impulse originated in products like Microsoft's Transaction Server and its approach to attribute-based programming and later products like Enterprise JavaBeans and now the Corba Component Model. All these address the speci?c needs of enterprise appli- tion servers. However, the potential of the deployment concept goes far beyond this. Deployment can and should touch e?ectively all truly component-based solutions. The proceedings of Component Deployment 2002 represent a good cro- section of the gamut of deployment issues. From customization to address - source constraints to recon?guration of deployed systems and from architecture to design to languages, the avid reader will?nd some contribution.

Ten years of,,Fuzzy Days“ in Dortmund! What started as a relatively small workshop in 1991 has now become one of the best known smaller conferences on Computational Intelligence in the world. It fact, it was (to my best knowledge) the?rst conference to use this term, in 1994, although I confess that another, larger conference was announced?rst and the trade mark “Computational Intelligence was not coined in Dortmund. I believe, that the success of this conference is grounded on the quality of its reviewedandinvitedpapersaswellasitsgoodorganization. Fromthebeginning, we have sent every paper anonymously to?ve referees, and we have always accepted only around 50% of the papers sent in. This year it was a little less than that. I would like to thank everybody who helped us by considering Dortmund's Fuzzy Days as the conference at which to appear. I know that among the - stracts not accepted there were some quite good ones, but we were restricted to a?xed number. I also know that referees do a good job but cannot always judge wisely from abstracts. Hence my apologies to those who did not make it this year. Please try again! I would like to point out that our conference also has a good regional re- tation. I am grateful to the City of Dortmund, its Lord Mayor Dr. Langemeyer, the Dortmund project, the DFG – Deutsche Forschungsgemeinschaft, the KVR – Kommunalverband Ruhrgebiet, the Martin-Schmeißer-Stiftung, and the C- line AG/Quantum GmbH for their valuable support.

The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ´ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi'(Julian Brad?eld) and ‘Parametrized Complexity'(Martin Grohe) – were given on the previous day.

This volume contains the proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) held in State College, Pennsylvania, USA, during 22-25 August 2000. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their - plications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency related aspects of: models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, veri?cation techniques, re?nement te- niques, term and graph rewriting, distributed programming, logic constraint p- gramming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and veri?cation. The?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991. The following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL), Nice (F), and Eindhoven (NL). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, 1466, and 1664.

This book constitutes the refereed proceedings of the 12th International Conference on Concurrency Theory, CONCUR 2001, held in Aalborg, Denmark in August 2001.The 32 revised full papers presented together with six invited contributions were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on mobility, probabilistic systems, model checking, process algebra, unfoldings and prefixes, logic and compositionality, and games.

We welcome you to Coordination'99, the third in a series of conferences d- icated to an important perspective on the development of complex software systems. That perspective is shared by a growing community of researchers - terested in models, languages, and implementation techniques for coordination. The last decade has seen the emergence of a class of models and languages variously termed “coordination languages”, “con?guration languages”, “arc- tectural description languages”, and “agent-oriented programming languages”. Theseformalismsprovideacleanseparationbetweenindividualsoftwarecom- nents and their interaction within the overall software organization. This se- ration makes complex applications more tractable, supports global analysis,and enhances the reuse of software components. The proceedings of the previous two conferences on this topic were published by Springer as Lecture Notes in Computer Science 1061 and 1282. This issue of LNCS containing the papers presented at Coordination'99 continues the tradition of carefully selected and high quality papers representing the state of the artin coordinationtechnology.In responseto thecallfor papers,wereceived 67 submissions, from which 26 papers were accepted. These proceedings also contain abstracts for posters presented at the conference. This year's program features invited talks by Rocco De Nicola and Danny B. Lange. Reading through the papers, we expect that you may be surprised by the variety of disciplines within computer science that have embraced the notion of coordination. In fact, we expect this trend to continue, and hope that you will contribute to the on-going exploration of its strengths, weaknesses, and applications.

This volume contains the proceedings of the Fifth International Conference on Coordination Models and Languages (Coordination 2002), held in York, UK, 8–11 April 2002. Coordination models and languages close the conceptual gap - tween the cooperation model used by the constituent parts of an application and the lower-level communication model used in its implementation. Coordinati- based methods provide a clean separation between individual software com- nents and their interactions within their overall software organization. This se- ration, together with the higher-level abstractions o?ered by coordination models and languages, improve software productivity, enhance maintainability, advocate modularity, promote reusability, and lead to software organizations and arc- tectures that are more tractable and more amenable to veri?cation and global analysis. Coordination is relevant in design, development, debugging, maintenance, and reuse of all complex concurrent and distributed systems. Speci?cally, - ordination becomes paramount in the context of open systems, systems with mobile entities, and dynamically re-con?gurable evolving systems. Moreover, - ordination models and languages focus on such key issues in Component Based Software Engineering as speci?cation, interaction, and dynamic composition of components.

Computers are gaining more and more control over systems that we use or rely on in our daily lives, privately as well as professionally. In safety-critical applications, as well as in others, it is of paramount importance that systems controled by a computer or computing systems themselves reliably behave in accordance with the specification and requirements, in other words: here correctness of the system, of its software and hardware is crucial. In order to cope with this callenge, software engineers and computer scientists need to understand the foundations of programming, how different formal theories are linked together, how compilers correctly translate high-level programs into machine code, and why transformations performed are justifiable. This book presents 17 mutually reviewed invited papers organized in sections on methodology, programming, automation, compilation, and application.

This book constitutes the refereed proceedings of the 15th European Conference on Object-Oriented Programming, ECOOP 2001, held in Budapest, Hungary, in June 2001.The 18 revised full papers presented together with one invited paper were carefully reviewed and selected from 108 submissions. The book is organized in topical sections on sharing and encapsulation, type inference and static analysis, language design, implementation techniques, reflection and concurrency, and testing and design.

The second XP Universe and?rst Agile Universe brought together many p- ple interested in building software in a new way. Held in Chicago, August 4–7, 2002 it attracted software experts, educators, and developers. Unlike most c- ferences the venue was very dynamic. Many activities were not even well de?ned in advance. All discussions were encouraged to be spontaneous. Even so, there were some written words available and you are holding all of them now. We have collected as much material as possible together into this small volume. It is just the tip of the iceberg of course. A reminder to us of what we learned, the people we met, and the ideas we expressed. The conference papers, including research and experience papers, are rep- duced in these proceedings. Forty-one (41) papers were submitted. Each subm- ted paper received three reviews by program committee members. The program committee consisted of 40 members. Papers submitted by program committee members were refereed separately. This ensured that reviewers could provide an honest feedback not seen by the paper submitters. In many cases, the program committee shepherded authors to signi?cantly improve their initial submission prior to completing the version contained in these proceedings. In the end, the program committee chose 25 papers for publication (60% acceptance).

Formal methods are coming of age. Mathematical techniques and tools are now regarded as an important part of the development process in a wide range of industrial and governmental organisations. A transfer of technology into the mainstream of systems development is slowly, but surely, taking place. FM'99, the First World Congress on Formal Methods in the Development of Computing Systems, is a result, and a measure, of this new-found maturity. It brings an impressive array of industrial and applications-oriented papers that show how formal methods have been used to tackle real problems. These proceedings are a record of the technical symposium ofFM'99:alo- side the papers describingapplicationsofformalmethods,youwill ndtechnical reports,papers,andabstracts detailing new advances in formaltechniques,from mathematical foundations to practical tools. The World Congress is the successor to the four Formal Methods Europe Symposia, which in turn succeeded the four VDM Europe Symposia. This s- cession re?ects an increasing openness within the international community of researchers and practitioners: papers were submitted covering a wide variety of formal methods and application areas. The programmecommittee re?ects the Congress's international nature, with a membership of 84 leading researchersfrom 38 di erent countries.The comm- tee was divided into 19 tracks, each with its own chair to oversee the reviewing process. Our collective task was a di cult one: there were 259 high-quality s- missions from 35 di erent countries.

Formal methods are coming of age. Mathematical techniques and tools are now regarded as an important part of the development process in a wide range of industrial and governmental organisations. A transfer of technology into the mainstream of systems development is slowly, but surely, taking place. FM'99, the First World Congress on Formal Methods in the Development of Computing Systems, is a result, and a measure, of this new-found maturity. It brings an impressive array of industrial and applications-oriented papers that show how formal methods have been used to tackle real problems. These proceedings are a record of the technical symposium ofFM'99:alo- side the papers describingapplicationsofformalmethods,youwill ndtechnical reports,papers,andabstracts detailing new advances in formaltechniques,from mathematical foundations to practical tools. The World Congress is the successor to the four Formal Methods Europe Symposia, which in turn succeeded the four VDM Europe Symposia. This s- cession re?ects an increasing openness within the international community of researchers and practitioners: papers were submitted covering a wide variety of formal methods and application areas. The programmecommittee re?ects the Congress's international nature, with a membership of 84 leading researchersfrom 38 di erent countries.The comm- tee was divided into 19 tracks, each with its own chair to oversee the reviewing process. Our collective task was a di cult one: there were 259 high-quality s- missions from 35 di erent countries.

This volume contains the proceedings of the 2002 symposium Formal Methods th Europe (FME 2002). The symposium was the 11 in a series that began with a VDM Europe symposium in 1987. The symposia are traditionally held every 18 months. In 2002 the symposium was held at the University of Copenhagen, as part of the 2002 Federated Logic Conference (FLoC 2002), which brought - gether in one event seven major conferences related to logic in computer science, as well as their a?liated workshops, tutorials, and tools exhibitions. Formal Methods Europe (www.fmeurope.org) is an independent association which aims to stimulate the use of, and research on, formal methods for software development. FME symposia have been notably successful in bringing together a community of users, researchers, and developers of precise mathematical - thods for software development. The theme of FME 2002 was “Formal Methods: Getting IT Right”. The double meaning was intentional. On the one hand, the theme acknowledged the signi?cant contribution formal methods can make to Information Technology, by enabling computer systems to be described precisely and reasoned about with rigour. On the other hand, it recognized that current formal methods are not perfect, and further research and practice are required to improve their foundations, applicability, and e?ectiveness.

ThisvolumecontainstheproceedingsofFM2003,the12thInternationalFormal Methods Europe Symposium which was held in Pisa, Italy on September 8–14, 2003. Formal Methods Europe (FME, www. fmeurope. org) is an independent - sociation which aims to stimulate the use of and research on formal methods for system development. FME conferences began with a VDM Europe symposium in 1987. Since then, the meetings have grown and have been held about once - ery 18 months. Throughout the years the symposia have been notably successful in bringing together researchers, tool developers, vendors, and users, both from academia and from industry. Unlike previous symposia in the series, FM 2003 was not given a speci?c theme. Rather, its main goal could be synthesized as “widening the scope. ” Indeed, the organizers aimed at enlarging the audience and impact of the symposium along several directions. Dropping the su?x ‘E'from the title of the conference re?ects the wish to welcome participation and contribution from every country; also,contributionsfromoutsidethetraditionalFormalMethodscommunitywere solicited. The recent innovation of including an Industrial Day as an important part of the symposium shows the strong commitment to involve industrial p- ple more and more within the Formal Methods community. Even the traditional and rather fuzzy borderline between “software engineering formal methods” and methods and formalisms exploited in di?erent?elds of engineering was so- what challenged.

This volume contains the proceedings of the 2003 International Conference on Formal Engineering Methods (ICFEM 2003). The conference was the?fth in a series that began in 1997. ICFEM 2003 was held in Singapore during 5–7 November 2003. ICFEM 2003 aimed to bring together researchers and practitioners from - dustry, academia, and government to advance the state of the art in formal engineering methods and to encourage a wider uptake of formal methods in industry. The Program Committee received 91 submissions from more than 20 co- tries in various regions. After each paper was reviewed by at least three referees in each relevant?eld, 34 high-quality papers were accepted based on originality, technical content, presentation and relevance to formal methods and software engineering. We wish to sincerely thank all authors who submitted their work for consideration. We would also like to thank the Program Committee members and other reviewers for their great e?orts in the reviewing and selecting process. Weareindebtedtothethreekeynotespeakers,Prof.IanHayesoftheUniv- sity of Queensland, Prof. Mathai Joseph of the Tata Research, Development and DesignCentre,andDr.ColinO'HalloranofQinetiQ,foracceptingourinvitation to address the conference.

Largeandcomplexsoftwaresystemsprovidethenecessaryinfrastuctureinall- dustries today. In order to construct such large systems in a systematic manner, the focus in the development methodologies has switched in the last two decades from functional issues to structural issues: both data and functions are enc- sulated into software units that are integrated into large systems by means of various techniques supporting reusability and modi?ability. This encapsulation principleisessentialtoboththeobject-orientedandthemorerecentcompone- based sofware engineering paradigms. Formalmethodshavebeenappliedsuccessfullytotheveri?cationofmedi- sized programs in protocol and hardware design. However, their application to large systems requires the further development of speci?cation and veri?cation techniques supporting the concepts of reusability and modi?ability. In order to bring together researchers and practioners in the areas of so- ware engineering and formal methods, we organized the 1st International S- posium on Formal Methods for Components and Objects (FMCO) in Leiden, The Netherlands, November 5–8, 2002. The program consisted of invited tu- rials and more technical presentations given by leading experts in the?elds of Theoretical Computer Science and Software Engineering. The symposium was attended by more than 100 people. This volume contains the contributions of the invited speakers to FMCO 2002. We believe that the presented material provides a unique combination of ideas on software engineering and formal methods which we hope will be an inspiration for those aiming at further bridging the gap between the theory and practice of software engineering.

This volume contains the proceedings of FMOODS 2003, the 6th IFIP WG 6. 1 International Conference on Formal Methods for Open Object-Based Distributed Systems. The conference was held in Paris, France on November 19–21, 2003. The event was the sixth meeting of this conference series, which is held roughly every year and a half, the earlier events having been held in Paris, Canterbury, Florence, Stanford, and Twente. ThegoaloftheFMOODSseriesofconferencesistobringtogetherresearchers whose work encompasses three important and related?elds: – formal methods; – distributed systems; – object-based technology. Such a convergence is representative of recent advances in the?eld of distributed systems,andprovideslinksbetweenseveralscienti?candtechnologicalcommu- ties, as represented by the conferences FORTE/PSTV, CONCUR, and ECOOP. The objective of FMOODS is to provide an integrated forum for the p- sentation of research in the above-mentioned?elds, and the exchange of ideas and experiences in the topics concerned with the formal methods support for open object-based distributed systems. For the call for papers, aspects of int- est of the considered systems included, but were not limited to: formal models; formal techniques for speci?cation, design or analysis; component-based design; veri?cation, testing and validation; semantics of programming, coordination, or modeling languages; type systems for programming, coordination or modelling languages; behavioral typing; multiple viewpoint modelling and consistency - tween di?erent models; transformations of models; integration of quality of s- vice requirements into formal models; formal models for security; and appli- tions and experience, carefully described.

In the past ten years or so, software architecture has emerged as a central notion in the development of complex software systems. Software architecture is now accepted in the software engineering research and development community as a manageable and meaningful abstraction of the system under development and is applied throughout the software development life cycle, from requirements analysis and validation, to design and down to code and execution level. This book presents the tutorial lectures given by leading authorities at the Third International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2003, held in Bertinoro, Italy, in September 2003. The book is ideally suited for advanced courses on software architecture as well as for ongoing education of software engineers using formal methods in their day-to-day professional work.

Java, undoubtedly, has its roots in embedded systems and the Web. Nevertheless, it is a fully functional high-level programming language that can provide users with a wide range of functionality and versatility. This thoroughly cross-reviewed state-of-the-art survey is devoted to the study of the syntax and semantics of Java from a formal-methods point of view. It consists of the following chapters by leading researchers: Formal Grammar for Java; Describing the Semantics of Java and Proving Type Soundness; Proving Java Type Soundness; Machine-Checking the Java Specification: Proving Type-Safety; An Event-Based Structural Operational Semantics of Multi-Threaded Java Dynamic Denotational Semantics of Java; A Programmer's Reduction Semantics for Classes and Mixins; A Formal Specification of Java Virtual Machine Instructions for Objects, Methods and Subroutines; The Operational Semantics of a Java Secure Processor; A Programmer Friendly Modular Definition of the Semantics of Java.

This volume contains the proceedings of FTRTFT 2002, the International S- posium on Formal Techniques in Real-Time and Fault-Tolerant Systems, held at the University of Oldenburg, Germany, 9–12 September 2002. This sym- sium was the seventh in a series of FTRTFT symposia devoted to problems and solutions in safe system design. The previous symposia took place in Warwick 1990, Nijmegen 1992, Lub ¨ eck 1994, Uppsala 1996, Lyngby 1998, and Pune 2000. Proceedings of these symposia were published as volumes 331, 571, 863, 1135, 1486, and 1926 in the LNCS series by Springer-Verlag. This year the sym- sium was co-sponsored by IFIP Working Group 2.2 on Formal Description of Programming Concepts. The symposium presented advances in the development and use of formal techniques in the design of real-time, hybrid, fault-tolerant embedded systems, covering all stages from requirements analysis to hardware and/or software - plementation. Particular emphasis was placed on UML-based development of real-time systems. Through invited presentations, links between the dependable systems and formal methods research communities were strengthened. With the increasing use of such formal techniques in industrial settings, the conference aimed at stimulating cross-fertilization between challenges in industrial usages of formal methods and advanced research. Inresponsetothecallforpapers,39submissionswerereceived.Eachsubm- sion was reviewed by four program committee members assisted by additional referees. At the end of the reviewing process, the program committee accepted 17 papers for presentation at the symposium.

ETAPS2000wasthethirdinstanceoftheEuropeanJointConferencesonTheory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprisedv e conferences (FOSSACS, FASE, ESOP,CC, TACAS), ve satellite workshops (CBS, CMCS, CoFI, GRATRA, INT), seven invited lectures, a panel discussion, and ten tutorials. The events that comprise ETAPS address various aspects of the system - velopmentprocess,includingspeci cation,design,implementation,analysis,and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Die rent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. ETAPS is a loose confederation in which each event retains its own identity, with a separate program committee and independent proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by. Contributed talks and system demonstrations are in synchronized parallel sessions, with invited lectures in plenary sessions. Two of the invited lectures are reserved for \u- fying'talks on topics of interest to the whole range of ETAPS attendees.