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.

th FM 2009, the 16 International Symposium on Formal Methods, marked the 10th an- versary of the First World Congress on Formal Methods that was held in 1999 in Toulouse, France. We wished to celebrate this by advertising and organizing FM 2009 as the Second World Congress in the FM series, aiming to once again bring together the formal methods communities from all over the world. The statistics displayed in the table on the next page include the number of countries represented by the Programme Committee members, as well as of the authors of submitted and accepted papers. Novel this year was a special track on tools and industrial applications. Subm- sions of papers on these topics were especially encouraged, but not given any special treatment. (It was just as hard to get a special track paper accepted as any other paper.) What we did promote, however, was a discussion of how originality, contri- tion, and soundness should be judged for these papers. The following questions were used by our Programme Committee.

This volume contains the ?nal proceedings of the 7th International Andrei Ershov Memorial Conference on Perspectives of System Informatics Akad- gorodok (Novosibirsk, Russia), June 15-19, 2009. PSI is a forum for academic and industrial researchers, developers and users working on topics relating to computer, software and information sciences. The conference serves to bridge the gaps between di?erent communities whose - searchareasarecoveredbybutnotlimitedtofoundationsofprogramandsystem development and analysis, programming methodology and softwareengineering, and information technologies. PSI 2009 was dedicated to the memory of a prominent scientist, academician Andrei Ershov (1931-1988), and to a signi?cant date in the history of computer science in the country, namely, the 50th anniversary of the Programming - partment founded by Andrei Ershov. Initially, the department was a part of the Institute of Mathematics and later, in 1964, it joined the newly established Computing Center of the Siberian Branch of the USSR Academy of Sciences. Andrei Ershov, who was responsible for forming the department, gathered a team of young graduates from leading Soviet universities. The ?rst signi?cant project of the department was aimed at the development of ALPHA system, an optimizing compiler for an extension of Algol 60 implemented on a Soviet c- puterM-20. Later, theresearchersofthedepartmentcreatedtheAlgibr, Epsilon, Sigma, and Alpha-6 programming systems for the BESM-6 computers. The list of their achievements also includes the ?rst Soviet time-sharing system AIST-0, the multi-language system BETA, research projects in arti?cial intelligence and parallel programming, integrated tools for text processing and publishing, and many othe

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 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7-11, 2010 in Prague. After six successful conferences held in 2004-2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi'an, and ChangSha) TAMC left Asia for the ?rst time, aiming at the "heart of Europe. " Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via ?awlessly and e?ciently running EasyChair. We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks - John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks "New Research Directions in the Information Age" and "The Laplacian Paradigm: Emerging Algorithms for Massive Graph" were highlights of the conference.

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.

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

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%.

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."

This book constitutes the refereed proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering, FASE 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 2 tool demonstrations were carefully reviewed and selected from 123 regluar and 9 tool paper submissions. The topics addressed are model-driven development, synthesis and adaptation, modeling, testing and debugging, model analysis, patterns, security, queries and error handling, and tools (demos) and program analysis.

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.

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.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the Internatonal Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007.

The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.

System administrators need libraries of solutions that are ingenious but understandable. They don't want to reinvent the wheel, but they don't want to reinvent filesystem management either Expert Shell Scripting is the ultimate resource for all working Linux, Unix, and OS X system administrators who would like to have short, succinct, and powerful shell implementations of tricky system scripting tasks. Automating small to medium system management tasks Analyzing system data and editing configuration files Scripting Linux, Unix, and OS X applications using bash, ksh, et al. What you'll learn Debug shell scripts using existing debuggers, not inspection. Use and extend textediting oneliners and learn to forget Perl. Manage files and filesystems using scripting, not inflexible utilities. Use scripts to build complete Linux systems. Script X Window without getting lost in configuration files. Ignore Python, and script in bash and ksh instead. Who this book is for

System administrators who need solutions to everyday problems.

This volume contains the proceedings of TFM2009, the Second International FME Conference on Teaching Formal Methods, organized by the Subgroup of Education of the Formal Methods Europe (FME) association. The conference took place as part of the ?rst Formal Methods Week (FMWeek), held in Ei- hoven, The Netherlands, in November 2009. TFM2009 was a one-day forum in which to explore the successes and fa- ures of formal method (FM) education, and to promote cooperative projects to further educationand training in FMs. The organizersgatheredlecturers,tea- ers,andindustrialpartnersto discusstheir experience,presenttheir pedagogical methodologies, and explore best practices. Interest in FM teaching is growing. TFM2009 followed in a series of events on teaching FMs which includes two BCS-FACS TFM workshops (Oxford in 2003, and London in 2006), the TFM2004 conference (Ghent, 2004, with p- ceedings published as Springer LNCS Volume 3294), the FM-Ed 2006 workshop (Hamilton, co-located with FM2006), FORMED (Budapest, at ETAPS2008), and FMET2008 (Kitakyushu, co-located with ICFEM2008). FMs have an important role to play in the development of complex c- puting systems-a role acknowledged in industrial standards such as IEC61508 and ISO/IEC15408, and in the increasing use of precise modelling notations, semantic markup languages, and model-driven techniques. There is a growing need for software engineers who can work e?ectively with simple, mathematical abstractions, and with practical notions of inference and proof.

This volume contains the papers presented at FMICS 2009, the 14th Inter- tional Workshop on Formal Methods for Industrial Critical Systems, whichwas held on November 2-3, 2009, in Eindhoven, The Netherlands. Previous wo- shops of the ERCIM working group on Formal Methods for Industrial Critical Systems were held in Oxford (March 1996), Cesena (July 1997), Amsterdam (May 1998), Trento (July 1999), Berlin (April 2000), Paris (July 2001), Malaga (July2002), Trondheim(June2003), Linz(September 2004), Lisbon(September 2005), Bonn (August 2006), Berlin (July 2007), and L'Aquila (September 2008). The aim of the FMICS workshop series is to provide a forum for researchers who are interested in the development and application of formal methods in industry. In particular, these workshops bring together scientists and engineers who are active in the area of formal methods and are interested in exchanging their experiences in the industrial usage of these methods. These workshops also strive to promote research and development for the improvement of formal methods and tools for industrial applications. The FMICS 2009 workshop was part of FMweek, the ?rst Formal Methods Week, whicho?eredachoiceofeventsinthearea, includingTESTCOM/FATES, Conferenceon TestingofCommunicatingSystemsandWorkshop on Formal- proaches to Testing of Software;FACS, Formal Aspects of Component Software; PDMC, Parallel and Distributed Methods of veri?Cation; FM2009, Symposium of Formal Methods Europe;CPA, Communicating Process Architectures;FAST, Formal Aspects of Security and Trust;FMCO, Formal Methods for Components and Objects; and the REFINE Workshop. All the information on FMweek can be found at http: //www.win.tue.nl/f

Wearepleasedtopresenttheproceedingsofthe14thMontereyWorkshop, which tookplaceSeptember10-13,2007inMonterey, CA, USA. Inthispreface, wegive the reader an overview of what took place at the workshop and introduce the contributions in this Lecture Notes in Computer Science volume. A complete introduction to the theme of the workshop, as well as to the history of the Monterey Workshop series, can be found in Luqi and Kordon's "Advances in Requirements Engineering: Bridging the Gap between Stakeholders' Needs and Formal Designs" in this volume. This paper also contains the case study that many participants used as a problem to frame their analyses, and a summary of the workshop's results. The workshop consisted of three keynote talks, three panels, presentations of peer-reviewed papers, as well as presentations of various position papers by the participants. The keynote speakers at this year's workshop were Daniel Berry, Aravind Joshi, and Lori Clarke. Each of their talks was used to set the tone for the p- sentations and discussions for that particular day. Daniel Berry presented an overview of the needs and challenges of natural language processing in requi- ments engineering, with a special focus on ambiguity in his talk "Ambiguity in Natural Language Requirements. " Aravind Joshi provided an overview of current natural language processing research in discourse analysis in the talk "Some Recent Developments in Natural Language Processing. " Finally, Lori Clarke showed how to combine formal requirements speci?cation with natural language processing to cope with the complex domain of medical information processes in "Getting the Details Right.

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.

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.

These proceedings are compiled from revised submissions presented at RV 2008, the 8th InternationalWorkshopon Runtime Veri?cationheld onMarch30, 2008 in Budapest, Hungary, as a satellite event of ETAPS 2008. There were 27 submissions. Each submission was reviewed by at least three ProgramCommitteemembers.Thecommitteedecidedtoacceptninepapers.This volume also includes two contributions by the invited speakers Jean Goubault- Larrecq(LSV/ENSCachan)on"ASmellofOrchids"andJohnRushby(SRI)on "RuntimeCerti?cation." We would like to thank the members of the Program Committee and the additional referees for their timely reviewing and lively participation in the s- sequent discussion-the quality of the contributions herein is due to their e?orts and expertise. We would like to thank the local organizers of ETAPS 2008 for facilitating this workshop. We would also like to thank the Technical University of Munich for their ?nancial support. Last but not least, we thank the parti- pants of RV 2008 for the stimulating discussions during the workshop and the authors for re?ecting this discussion in their revised papers. We acknowlege the e?ort of the EasyChair support team.

This volume includes extended and revised versions of the papers presented at the 9th and 10th International Workshops on Learning Classi?er Systems (IWLCS 2006 and IWLCS 2007). Both workshops were held in association with theGeneticandEvolutionaryComputationConference(GECCO).IWLCS2006 was held on July 8th, 2006, in Seattle, USA, during GECCO 2006.IWLCS 2007 was held on July 8th, 2007, in London, UK, during GECCO 2007. The IWLCS is the annual meeting of researchers wishing to discuss recent developments in learning classi?er systems (LCS). At the last IWLCS, the LCS researchers commemorated the 10th anniversary of the workshop and ackno- edged the contribution of Stewart Wilson to the ?eld. Following his proposal of the XCS classi?er system in 1995, research on LCS was reactivated leading to signi?cant contributions and promising perspectives. The annual IWLCS wo- shops are the proof of this fruitful research. We include an invited paper from Stewart Wilson. We greatly appreciate his contribution to the volume. The contents of this book are as follows. First, Bacardit, Bernado -Mansilla and Butz review LCS research over the past ten years and point out new ch- lenges and open issues in the LCS ?eld. Next, papers investigating knowledge representations are presented. Lanzi et al. analyze the evolution of XCS with symbolic representations using a novel method that identi?es useful substr- tures and tracks the emergence of optimal solutions. Ioannides and Browne investigate the scaling of LCSs using ternary and symbolic representations."