This volume contains the papers presented at NLDB 2009, the 14th Inter- tional Conference on Applications of Natural Language to Information Systems held June 24-26, 2009, at the University of the Saarland and the German - search Center for Arti?cial Intelligence in Saarbruc ken, Germany. In addition to reviewed submissions, the program also included contributions to the doctoral symposiumheldduring NLDB2009aswellastwoinvitedtalks.Thesetalksc- ered some of the currently hot topics in the use of natural languagefor accessing information systems. Wereceived51submissionsasregularpapersforthemainconference,2extra submissions as posters, and 3 short papers for the doctoral symposium. Each paper for the main conference was assigned four reviewers, taking into account preferences expressed by the ProgramCommittee members as much as possible. Within the review deadline, we received at least three reviews for almost all submissions. After the review deadline, the Conference Organizing Committee members and the Program Committee Chair acted as meta-reviewers. This task included studying the reviews and the papers, speci?cally those whose assessment made them borderline cases, and discussing con?icting opinions and their impact on theassessmentofindividualpapers.Finally,themeta-reviewerswroteadditional reviews for the few papers which received less than three reviews, as well as for papers which received reviews with considerably con?icting assessments.

Thisvolumecontainsthepapersofthe20thInternationalConferenceonRewr- ing Techniques and Applications (RTA 2009), which was held from June 29 to July 1, 2009, in Bras' ?lia, Brazil as part of the 5th International Conference on Rewriting, Deduction, and Programming (RDP 2009) together with the Int- national Conference on Typed Lambda Calculi and Applications (TLCA 2009), the International School on Rewriting (ISR 2009), the 4th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2009), the 10th Inter- tional Workshop on Rule-Based Programming (RULE 2009), the 8th Inter- tional Workshop on Functional and (Constraint) Logic Programming (WFLP 2009), the 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), and the annual meeting of the IFIP Working Group 1.6 on term rewriting. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), R- gers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht(2001),Copenhagen(2002),Valencia(2003),Aachen(2004),Nara(2005), Seattle (2006), Paris (2007), and Hagenberg (2008).

This book constitutes the refereed proceedings of the 11th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2009, and 29th IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2009, held in Lisboa, Portugal, in June 2009.

The 12 revised full papers presented together with 6 short papers were carefully reviewed and selected from 42 submissions. The papers cover topics such as formal verification, algorithms and implementations, modeling and testing, process algebra and calculus as well as analysis of distributed systems.

This volume presents the set of papers accompanying the lectures of the 9th International School on Formal Methods for the Design of Computer, Com- nication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience asaprominentapproachtotherigorousdesignofcomputer, communication, and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2009 was devoted to formal methods for Web services and covered s- eral aspects including choreography, orchestration, description techniques, - teraction, synthesis, composition, session types, contracts, veri?cation, security, and performance. This volume comprises eight articles. Bruni's paper overviews some of the most recently proposed abstractions in the setting of process calculi tailored to the well-disciplined handling of issues such as long-running interactions, orch- tration, and unexpected events. Van der Aalst, Mooij, Stahl, and Wolf provide some foundational notions related to service interaction and address in a Petri net setting challenges like how to expose a service, how to replace and re?ne services, and how to generate service adapters. The paper by Marconi and - store presents a survey of existing approaches to the synthesis of Web service compositions, a di?cult and error-pronetask that requires automated solutions.

Liferay Portal is the leading open-source enterprise portal framework that uses Java and Web 2.0 technologies.

Web portals often function as a point of access to information on the World Wide Web. Web portals, such as Yahoo , present information from diverse sources in a unified way. Aside from the search engine standard, web portals offer other services such as email, news, stock prices, infotainment, and various other features. Portals provide a means for enterprises to supply a consistent look and feel with access control and procedures for multiple applications that otherwise would have been separate entities altogether.

So, how do developers bring existing applications, as well as integrate content management systems and search engines, into a portal? And how do developers get started with the Liferay Portal engine? In Practical Liferay: Javabased Portal Applications Development, Dr. PoornachandraSarang answers these questions and more.

This book is for those who want to learn how to use Liferay to develop vertical or companyspecific web portals and beyond. The book will serve as a practical guide to learning Liferay and developing realworld web portals. What you'll learn Become an expert of the Liferay portal engine. Create dynamic web portals. Use templatebased design for easy fit and form. Design and integrate discussion forums, chats, and IM. Build blogs, wikis, RSS feeds, and more. Use Liferay for developing Javabased content management software. Deploy and manage portal administration. Who this book is for

This book is for web and portal developers who use Java to build Web 2.0 portals for their company, enterprise, or even personal use. The book does not require any programming background and will be very useful for web developers in learning practical portal development.

It is commonly assumed that computers process information. But what is inf- mation? In a technical, important, but nevertheless rather narrow sense, Sh- non'sinformationtheorygivesa?rstanswertothisquestion.Thistheoryfocuses on measuring the information content of a message. Essentially this measure is the reduction of the uncertainty obtained by receiving a message. The unc- tainty of a situation of ignorance in turn is measured by entropy. This theory hashad an immense impact on the technologyof information storage,data c- pression, information transmission and coding and still is a very active domain of research. Shannon's theory has also attractedmuch interest in a more philosophic look at information, although it was readily remarked that it is only a "syntactic" theory of information and neglects "semantic" issues. Several attempts have been made in philosophy to give information theory a semantic ?avor, but still mostly based on or at least linked to Shannon's theory. Approaches to semantic informationtheoryalsoveryoftenmakeuseofformallogic.Thereby,information is linked to reasoning, deduction and inference, as well as to decision making. Further, entropy and related measure were soon found to have important connotations with regard to statistical inference. Surely, statistical data and observation represent information, information about unknown, hidden para- ters. Thus a whole branch of statistics developed around concepts of Shannon's information theory or derived from them. Also some proper measurements - propriate for statistics, like Fisher's information, were proposed.

This volume contains a selection of papers presented at the 17th International Conference on Applications of Declarative Programming and Knowledge M- agement INAP 2007 and the 21st Workshop on Logic Programming WLP 2007, which were held jointly in Wu ]rzburg, Germany, during October 4-6, 2007. Declarative programming is anadvancedparadigmforthe modelingandso- ing of complex problems. This speci?cation method has become more and more attractiveoverthelastyears, e.g., inthedomainsofdatabases, fortheprocessing of natural language, for the modeling and processing of combinatorial problems, and for establishing knowledge-based systems for the Web. The INAP conferences provide a forum for intensive discussions of appli- tions of important technologies around logic programming, constraint problem solving, and closely related advanced software. They comprehensively cover the impactof programmablelogic solversin the Internetsociety, its underlying te- nologies, and leading-edge applications in industry, commerce, government, and societal services. The WorkshopsonLogicProgrammingarethe annualmeeting of the Society for Logic Programming (GLP e.V.). They bring together researchers interested in logic programming, constraint programming, and related areas like databases and arti?cial intelligence. Previous workshops have been held in Germany, A- tria and Switzerland. The topics of the selected papers of this year's joint conference concentrated on three currently important ?elds: constraint programming and constraint solving, databases and data mining, and declarative programming with logic languages. Duringthelastcoupleofyearsalotofresearchhasbeenconductedonthe- ageof declarativeprogrammingfor databases and data mining. Reasoning about knowledgewrappedinrules, databases, ortheWeballowsonetoexploreintere- ing hidden knowledge.Declarativetechniques for the transformation, deduction, induction, visualization, or querying of knowledge, or data mining techniques for exploring knowledge have the advantage of high transparency and better maintainability compared to procedural approaches.

The art, craft, discipline, logic, practice, and science of developing large-scale software products needs a believable, professional base. The textbooks in this three-volume set combine informal, engineeringly sound practice with the rigour of formal, mathematics-based approaches.

Volume 1 covers the basic principles and techniques of formal methods abstraction and modelling. First this book provides a sound, but simple basis of insight into discrete mathematics: numbers, sets, Cartesians, types, functions, the Lambda Calculus, algebras, and mathematical logic. Then it trains its readers in basic property- and model-oriented specification principles and techniques. The model-oriented concepts that are common to such specification languages as B, VDM-SL, and Z are explained here using the RAISE specification language (RSL). This book then covers the basic principles of applicative (functional), imperative, and concurrent (parallel) specification programming. Finally, the volume contains a comprehensive glossary of software engineering, and extensive indexes and references.

These volumes are suitable for self-study by practicing software engineers and for use in university undergraduate and graduate courses on software engineering. Lecturers will be supported with a comprehensive guide to designing modules based on the textbooks, with solutions to many of the exercises presented, and with a complete set of lecture slides.

The LNCS journal Transactions on Computational Science reflects recent developments in the field of Computational Science, conceiving the field not as a mere ancillary science but rather as an innovative approach supporting many other scientific disciplines. The journal focuses on original high-quality research in the realm of computational science in parallel and distributed environments, encompassing the facilitating theoretical foundations and the applications of large-scale computations and massive data processing. It addresses researchers and practitioners in areas ranging from aerospace to biochemistry, from electronics to geosciences, from mathematics to software architecture, presenting verifiable computational methods, findings and solutions and enabling industrial users to apply techniques of leading-edge, large-scale, high performance computational methods.

The fifth volume of the Transactions on Computational Science journal, edited by Yingxu Wang and Keith C.C. Chan, is devoted to the subject of cognitive knowledge representation. This field of study focuses on the internal knowledge representation mechanisms of the brain and how these can be applied to computer science and engineering. The issue includes the latest research results in internal knowledge representation at the logical, functional, physiological, and biological levels and describes their impacts on computing, artificial intelligence, and computational intelligence.

This volume contains the papers presented at WoLLIC 2010: 17th Workshop on Logic, Language, Information and Computation held during July 6-9, 2010, on the campus of Universidade de Bras ?lia (UnB), Brazil. The Workshop on Logic, Language, Information and Computation (WoL- LIC) is an annual event, meeting every year since 1994, which aims at 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. The present volume contains 13 contributed papers that were selected from among 32 submissions after a rigorous review by the Program Committee. Each submission was reviewed by at least two, and on average three, Program C- mittee members. This volume also containspapersor abstractsthat relateto the seven invited talks presented at the workshop. Between them, these papers give a snapshot of some fascinating work taking place at the frontiers between computation, logic, and linguistics. We are grateful to all the people who made this meeting possible and are responsible for its success: the members of the Program Committee and the external reviewers, the invited speakers, the contributors, and the people who were involved in organizing the workshop."

We are pleased to present the proceedings of the First International Conf- ence on Software LanguageEngineering (SLE 2008). The conference was held in th Toulouse, FranceduringSeptember29-30,2008andwasco-locatedwiththe11 IEEE/ACM International Conference on Model-Driven Engineering Languages and Systems (MODELS 2008). The SLE conference series is devoted to a wide range of topics related to arti?cial languages in software engineering. SLE is an international research forum that brings together researchers and practitioners from both industry and academia to expand the frontiers of software language engineering. Historically, SLE emerged from two established workshop series: LDTA, Language Descriptions, Tools, and Applications, which has been a sat- lite event at ETAPS for the last 9 years, and ATEM which has been co-located with MODELS and WCRE for 5 years. SLE'sforemostmissionis to encourageand organizecommunicationbetween communities that have traditionally looked at software languagesfrom di?erent, more specialized, and yet complementary perspectives. SLE emphasizes the f- damental notion of languages as opposed to any realization in speci?c technical spaces. In this context, the term "software language" comprises all sorts of - ti?cial languages used in software development including general-purpose p- gramming languages, domain-speci?c languages, modeling and meta-modeling languages, data models, and ontologies. Software language engineering is the application of a systematic, disciplined, quanti?able approach to the devel- ment, use, andmaintenanceoftheselanguages. TheSLEconferenceisconcerned with all phases of the lifecycle of software languages; these include the design, implementation, documentation, testing, deployment, evolution, recovery, and retirement of languages.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007, held in Tbilisi, Georgia, in October 2007.

The 22 revised full papers included in the book were carefully reviewed and selected from numerous presentations given at the symposium. The focus of the papers is on the following topics: conceptual modeling of spatial relations, pragmatics and game theory, atypical valency phenomena, lexical typology, formal semantics and experimental evidence, exceptional quantifier scope, Georgian focussing particles, polarity and pragmatics, dynamics of belief, learning theory, inquisitive semantics, modal logic, coalgebras, computational linguistics of Georgian, type-logical grammar and cross-serial dependencies, non-monotonic logic, Japanese quantifiers, intuitionistic logic, semantics of negated nominals, word sense disambiguation, semantics of question-embedding predicates, and reciprocals and computational complexity.

A family of internationally popular microcontrollers, the Atmel AVR microcontroller series is a low-cost hardware development platform suitable for an educational environment. Until now, no text focused on the assembly language programming of these microcontrollers. Through detailed coverage of assembly language programming principles and techniques, Some Assembly Required: Assembly Language Programming with the AVR Microcontroller teaches the basic system capabilities of 8-bit AVR microcontrollers.

The text illustrates fundamental computer architecture and programming structures using AVR assembly language. It employs the core AVR 8-bit RISC microcontroller architecture and a limited collection of external devices, such as push buttons, LEDs, and serial communications, to describe control structures, memory use and allocation, stacks, and I/O. Each chapter contains numerous examples and exercises, including programming problems.

By studying assembly languages, computer scientists gain an understanding of the functionality of basic processors and how their capabilities support high level languages and applications. Exploring this connection between hardware and software, this book provides a foundation for understanding compilers, linkers, loaders, and operating systems in addition to the processors themselves.

The ILP conference series has been the premier forum for work on logic-based approaches to machine learning for almost two decades. The 19th International Conference on Inductive Logic Programming, which was organized in Leuven, July2-4,2009, continuedthistraditionbutalsoreachedouttoothercommunities as it was colocated with SRL-2009 - the International Workshop on Statistical RelationalLearning, andMLG-2009-the7thInternationalWorkshoponMining andLearningwithGraphs. While thesethreeseriesofeventseachhavetheirown focus, emphasis andtradition, they essentiallysharethe problemthatis studied: learning about structured data in the form of graphs, relational descriptions or logic. The colocation of the events was intended to increase the interaction between the three communities. There was a single program with joint invited and tutorial speakers, a panel, regular talks and poster sessions. The invited speakers and tutorial speakers were James Cussens, Jason Eisner, Jure Leskovec, Raymond Mooney, Scott Sanner, and Philip Yu. The panel featured Karsten Borgwardt, Luc De Raedt, Pedro Domingos, Paolo Frasconi, Thomas Gart ] ner, Kristian Kersting, Stephen Muggleton, and C. David Page. Video-recordings of these talks can be found atwww. videolectures. net. The overall program featured 30 talks presented in two parallel tracks and 53 posters. The talks and posters were selected on the basis of an extended abstract. These abstracts can be found at http: // dtai. cs. kuleuven. be/ilp-mlg-srl/. Inaddition, asinpreviousyears, a- lectionofthepapersofILP2009havebeenpublishedinavolumeintheLectures Notes in Arti?cial Intelligence seriesandinaspecialissueoftheMachine Lea- ing Jou

Expert F# is about practical programming in a beautiful language that puts the power and elegance of functional programming into the hands of .NET developers. In combination with .NET, F# achieves unrivaled levels of programmer productivity and program clarity. This books serves asThe authoritative guide to F# by the designer of F# A comprehensive reference of F# concepts, syntax, and features A treasury of expert F# techniques for practical, realworld programming

While inspired by OCaml, F# isn't just another functional programming language. Drawing on many of the strengths of both OCaml and .NET, it's a generalpurpose language ideal for realworld development. F# integrates functional, imperative, and objectoriented programming styles so you can flexibly and elegantly solve programming problems, and brings .NET development alive with interactive execution. Whatever your background, you'll find that F# is easy to learn, fun to use, and extraordinarily powerful. F# will help change the way you think about and go about programming.

Written by F#'s designer and two active contributors, Expert F# is the authoritative, comprehensive, and indepth guide to the language and its use. Designed to help others become experts, the book gives a thorough introduction to the F# language from quick essentials to indepth advanced topics such as active pattern matching, aggregate data types and operators, sequence expressions, lazy values, mutable data and sideeffects, generics, type augmentations, functional decomposition and code organization.

The second half of the book is devoted to examining the practical application of F#, providing elegant solutions to common programming tasks includinguser interfaceimplementation, data access, web and distributed programming, symbolic and numerical computations, concurrent programming, testing, profiling, and interoperability with other languages. The latest hot developments in F# and .NET are also addressed, including Active Patterns, implicit class construction, integration with LINQ over relational data, meta programming and useful tips for working with Visual Studio and F# commandline tools.

The worlds foremost experts in F# show you how to program in F# the way they do What you'll learn How to use F# for functional, imperative, and objectoriented programming How to code elegant F# solutions with expert technique and style How to develop Windows, web, graphics, and database applications in F# How to do numerical, concurrent, lexical, and symbolic processing in F# How to interoperate with C and COM Who this book is for

This book is for anyone interested in state-of-the art .NET programming. Professional programmers will find it engrossing. F# provides invaluable insight into the future of both C# and VB, which are now adopting some (but far from all) of the functional features of F#. Once they learn F#, few feel like returning to either C# or VB. The academic community will find F# the answer to a decades-long prayer: a language suitable for teaching computer science that also excites and empowers students because it can be used not just in the classroom, but also in the real world.

This book constitutes the refereed proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2009, held in York, UK, in March 2009, as part of ETAPS 2009, the European Joint Conferences on Theory and Practice of Software.

The 30 revised full papers presented together with two invited talks were carefully reviewed and selected from 102 full paper submissions. The topics addressed are semantics, logics and automata, algebras, automata theory, processes and models, security, probabilistic and quantitative models, synthesis, and program analysis and semantics.

This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2008, held in Valencia, Spain, during July 17-18, 2008.

The 11 revised full papers presented together with one invited talk were carefully reviewed and selected for inclusion in the book. LOPSTR traditionally solicits papers in the areas of specification, synthesis, verification, transformation, analysis, optimization, composition, security, reuse, applications and tools, component-based software development, software architectures, agent-based software development, and program refinement.

Sharpen your coding skills by exploring established computer science problems! Classic Computer Science Problems in Java challenges you with time-tested scenarios and algorithms. You'll work through a series of exercises based in computer science fundamentals that are designed to improve your software development abilities, improve your understanding of artificial intelligence, and even prepare you to ace an interview. Classic Computer Science Problems in Java will teach you techniques to solve common-but-tricky programming issues. You'll explore foundational coding methods, fundamental algorithms, and artificial intelligence topics, all through code-centric Java tutorials and computer science exercises. As you work through examples in search, clustering, graphs, and more, you'll remember important things you've forgotten and discover classic solutions to your "new" problems! Key Features * Recursion, memorization, bit manipulation * Search algorithms * Constraint-satisfaction problems * Graph algorithms * K-means clustering For intermediate Java programmers. About the technology In any computer science classroom you'll find a set of tried-and-true algorithms, techniques, and coding exercises. These techniques have stood the test of time as some of the best ways to solve problems when writing code, and expanding your Java skill set with these classic computer science methods will make you a better Java programmer. David Kopec is an assistant professor of computer science and innovation at Champlain College in Burlington, Vermont. He is the author of Dart for Absolute Beginners (Apress, 2014), Classic Computer Science Problems in Swift (Manning, 2018), and Classic Computer Science Problems in Python (Manning, 2019).

The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently, the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of "parametrized semantics" is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose, it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation.

th CICLing 2009 markedthe 10 anniversary of the Annual Conference on Intel- gent Text Processing and Computational Linguistics. The CICLing conferences provide a wide-scope forum for the discussion of the art and craft of natural language processing research as well as the best practices in its applications. This volume contains ?ve invited papers and the regular papers accepted for oral presentation at the conference. The papers accepted for poster presentation were published in a special issue of another journal (see the website for more information). Since 2001, the proceedings of CICLing conferences have been published in Springer's Lecture Notes in Computer Science series, as volumes 2004, 2276, 2588, 2945, 3406, 3878, 4394, and 4919. This volume has been structured into 12 sections: - Trends and Opportunities - Linguistic Knowledge Representation Formalisms - Corpus Analysis and Lexical Resources - Extraction of Lexical Knowledge - Morphology and Parsing - Semantics - Word Sense Disambiguation - Machine Translation and Multilinguism - Information Extraction and Text Mining - Information Retrieval and Text Comparison - Text Summarization - Applications to the Humanities A total of 167 papers by 392 authors from 40 countries were submitted for evaluation by the International Program Committee, see Tables 1 and 2. This volume contains revised versions of 44 papers, by 120 authors, selected for oral presentation; the acceptance rate was 26. 3%.

Learning to program isn't just learning the details of a programming language: to become a good programmer you have to become expert at debugging, testing, writing clear code and generally unsticking yourself when you get stuck, while to do well in a programming course you have to learn to score highly in coursework and exams. Featuring tips, stories and explanations of key terms, this book teaches these skills explicitly. Examples in Python, Java and Haskell are included, helping you to gain transferable programming skills whichever language you are learning. Intended for students in Higher or Further Education studying early programming courses, it will help you succeed in, and get the most out of, your course, and support you in developing the software engineering habits that lead to good programs.

Formal methods for development of computer systems have been extensively studied over the years. A range of semantic theories, speci?cation languages, design techniques, and veri?cation methods and tools have been developed and applied to the construction of programs used in critical applications. The ch- lenge now is to scale up formal methods and integrate them into engineering - velopment processes for the correct and e?cient construction and maintenance of computer systems in general. This requires us to improve the state of the art on approaches and techniques for integration of formal methods into industrial engineering practice, including new and emerging practice. The now long-established series of International Conferences on Formal - gineering Methods brings together those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend and to help - vance the state of the art. This volume contains the papers presented at ICFEM 2009, the 11th International Conference on Formal Engineering Methods, held during December 9-11, in Rio de Janeiro, Brazil.

This book constitutes the refereed proceedings of the 7th Asian Symposium on Programming Languages and Systems, APLAS 2009, held in Seoul, Korea, in December 2009.

The 21 papers presented in this volume together with 3 invited talks were carefully reviewed and selected from 56 submissions. The papers are divided into topical sections on program analysis, transformation and optimization, type system, separation logic, logic and foundation theory, software security and verification, and software security and verification.

ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryand Practiceof Software. ETAPS is anannual federatedconference that was establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CC,ESOP,FASE,FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rate of 26%, with most of the conferences at around 24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. 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,withaninclinationtowardtheorywithapracticalmotivationonthe 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 confederation in which each event retains its own identity, with a separate Programme Committee and proceedings.