The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. Volume XIII contains 14 papers which introduce a number of new advances in both the foundations and the applications of rough sets. These are mathematical structures of generalized rough sets in infinite universes, approximations of arbitrary binary relations, and attribute reduction in decision-theoretic rough sets. Methodological advances introduce rough set-based and hybrid methodologies for learning theory, attribution reduction, decision analysis, risk assessment, and data mining tasks such as classification and clustering. In addition, this volume contains regular articles on mining temporal software metrics data, iGAME discretization method, perceptual tolerance intersection as an example of a near set operation and compression of spatial data with quadtree structures.

This book constitutes the refereed proceedings of the 13th International Symposium on Practical Aspects of Declarative Languages, PADL 2011, held in Austin, TX, USA, in January 2011, co-located with POPL 2011, the Symposium on Principles of Programming Languages. The 17 revised full papers presented together with one application paper were carefully reviewed and selected from 40 submissions. The volume features a variety of contributions ranging from message-passing and mobile networks, concurrent and parallel programming, event processing and reactive programming, profiling and portability in Prolog, constraint programming, grammar combinators, belief set merging and work on new language extensions and tools.

This volume constitutes the refereed proceedings of the 18th International Symposium on Graph Drawing, GD 2010, held in Konstanz, Germany, during September 2010. The 30 revised full papers presented together with 5 revised short and 8 poster papers were carefully reviewed and selected from 77 submissions. The volume also contains a detailed report about the 17th Annual Graph Drawing Contest, held as a satellite event of GD 2010. Devoted both to theoretical advances as well as to implemented solutions, the papers are concerned with the geometric representation of graphs and networks and are motivated by those applications where it is crucial to visualize structural information as graphs.

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 4th Indian Conference on Logic and Its Applications, ICLA 2011, held in Delhi, India, in January 2011. The 14 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 34 submissions. The papers present current research in all aspects of formal logic ranging from pure and applied logic to history of logic.

th This Festschrift is dedicated to Christoph Walther on the occasion of his 60 th birthday on August 9 , 2010. It consists of articles by some of his colleagues and former students, who, on this momentous occasion, chose to show their appreciation. Inteachingtheoreticalcomputerscience,Christophhas hadaprofoundin- ence onmany ofhis formerandcurrentstudents,notleastby the introductionof eriFun into the classroom. Outside of his teaching, developing eriFun played a major role in his recent research activities. When the idea for this Festschrift was ?rst presented to us, it quickly - came apparent that Christoph's work in the ?elds of veri?cation, induction and termination analysis would be mirrored in the contributions, leading us to refer to this project as "VITA". Since many of the authors have known Christoph for much longer than we have, we feel that the contributions themselves give a better insight into his f- mer and present work than we possibly could. On that note, we hope Christoph enjoys reading this Festschrift and wish him all the best for his future. The editors wouldlike to thank everyonewho showedinterestin this project, especially the authors for their contributions and the organisers of the col- quium. Furthermore we would like to thank Kai Sachs for his work in coordin- ing this Festschrift with Springer. Last, but certainly not least, Veronika Weber hasearnedourheartfeltgratitudewithherconstantguidanceandhelpfuladvice.

Manfred Nagl has been a very active, productive researcher with great impact in a number of di?erent areas,e.g., graphtransformationsand their applications to a wide range of disciplines, software engineering environments, engineering designprocesses,andsoftwarearchitectures.We-?veofhisnumerousacademic descendants - were in?uenced deeply by Manfred's work. For this reason, we decided to prepare this volume, which was edited in his honor on the occasion of his 65th birthday. A "pre-release"(book of abstracts) was presented to Manfred atacelebrationatRWTHAachenUniversityinJune2009.Thecompletevolume followed when Manfred received an honorary doctorate from the University of Paderborn in November 2010. Altogether, we collected 30 papers. The types of papers vary signi?cantly, including classic research papers in the style of journal articles, surveys of - cused research areas, essays re?ecting on certain research topics, and papers summarizing long-term work conducted by Manfred Nagl. All papers were subject to a thorough quality control process involving at least two reviews for each paper. The editors were assisted by numerous ad- tional reviewers, whose work is gratefully acknowledged.

Thepresentvolumewasdevotedto thethirdeditionofthe InternationalSym- sium on Algorithmic Game Theory (SAGT), an interdisciplinary scienti?c event intended to provide a forum for researchers as well as practitioners to exchange innovative ideas and to be aware of each other's e?orts and results. SAGT 2010 took place in Athens, on October 18-20, 2010. The present volume contains all contributed papers presented at SAGT 2010 together with the distinguished invited lectures of Amos Fiat (Tel-Aviv University, Israel), and Paul Goldberg (University of Liverpool, UK). The two invited papers are presented at the - ginning of the proceedings, while the regular papers follow in alphabetical order (by the authors' names). In response to the call for papers, the Program Committee (PC) received 61 submissions.Amongthesubmissionswerefour paperswith atleastonecoauthor that was also a PC member of SAGT 2010. For these PC-coauthored papers, anindependent subcommittee (EliasKoutsoupias,PaulG. Spirakis,andXiaotie Deng) made the judgment, and eventually two of these papers were proposedfor inclusion in the Scienti?c Program. For the remaining 57 (non-PC-coauthored) papers, the PC of SAGT 2010 conducted a thorough evaluation (at least 3, and on average 3.9 reviews per paper) and electronic discussion, and eventually selected 26 papers for inclusion in the Scienti?c Program. An additional tutorial, "Games Played in Physics", was also provided in SAGT 2010, courtesy of the academic research network Algogames (A??o?a????o) of the University of Patras.

This volume contains the proceedings of the Eighth International Workshop on Rewriting Logic and its Applications (WRLA 2010) that was held in Paphos, Cyprus, March 20-21, 2010, as a satellite workshop of the European Joint C- ferences on Theory and Practice of Software (ETAPS 2010). Rewriting logic is a natural semantic framework for representing conc- rency,parallelism,communicationandinteraction,aswellasbeing anexpressive (meta)logical framework for representing logics. It can then be used for spe- fying a wide range of systems and programming languages in various appli- tion ?elds. In recent years, several executable speci?cation languages based on rewriting logic (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the WRLA workshop series is to bring together - searchers with a common interest in rewriting logic and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. Previous WRLA workshops were held in Asilomar (1996), Pont-a-Mousson ' (1998), Kanazawa (2000), Pisa (2002), Barcelona (2004), Vienna (2006), and Budapest (2008), and their proceedings have been published inElectronic Notes in Theoretical Computer Science. In addition, selected papers from WRLA 1996 have been published in a special issue of Theoretical Computer Science,and selected papers from WRLA 2004 appeared in a special issue of Higher-Order and Symbolic Computation.

This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6-8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory.

Static analysis is a research area aimed at developing principles and tools for veri?cation, certi?cation, semantics-based manipulation, and high-performance implementation of programming languages and systems. The series of Static Analysis Symposia has served as the primary venue for presentation and disc- sion of theoretical, practical, and applicational advances in the area. th This year's symposium, The 17 International Static Analysis Symposium (SAS 2010), was held on September 14-16, 2010 in Perpignan, France, with 3 a?liated workshops: NSAD 2010 (The Second Workshop on Numerical and Symbolic Abstract Domains), SASB 2010 (The First Workshop on Static An- ysis and Systems Biology) on September 13, 2010, and TAPAS 2010 (Tools for Automatic Program Analysis) on September 17, 2010. The programme of SAS 2010 included a special session dedicated to the memory of the outstanding computer scientists Robin Milner and Amir Pnueli. This session consisted of 5 invited talks by E. Allen Emerson (The University of Texas at Austin, USA), Benjamin Goldberg (New York University, USA), James Leifer (INRIA Paris-Rocquencourt, France), Joachim Parrow (Uppsala University, Sweden), and Glynn Winskel (University of Cambridge, UK). There were 58 submissions. Each submission was reviewed by at least three programme committee members. The committee decided to accept 22 papers. In addition to the special session and the 22 contributed papers, the p- gramme included 4 invited talks by Manuel Fa ..hndrich (Microsoft Research, USA), David Lesens (EADS Space Transportation, France), Andreas Podelski (Freiburg University, Germany), and Mooly Sagiv (Tel-Aviv University, Israel and Stanford University, USA).

This volume contains the papers that were presented at the 8th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2010), held September 8-10, 2010, at IST (Institute of Science and Technology) Austria, in Klosterneuburg, Austria. The modeling andanalysis oftiming aspects of systems is a keyproblem that has been treated independently in several di?erent communities in computer science and related areas. Researchers interested in semantics, veri?cation, re- timescheduling,andperformanceanalysisstudymodelssuchastimedautomata and timed Petri nets, the digital design community focuses on propagation and switching delays, and designers of embedded controllers need to take into - count the time requiredby controllersto compute their responses after sampling the environment. Although the timing-related questions in these separate c- munities have their own speci?c nature, there is a growing awareness that there are basic problems that are common to all of them. In particular, all of these disciplines model and analyze systems whose behavior depends on combinations of logical and timing constraints between occurrences of events. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from di?erent d- ciplines that share an interest in the modeling and analysis of timed systems. Typical topics include (but are not limited to): - Foundations and Semantics: theoretical foundations of timed systems and languages; comparison between di?erent models (timed automata, timed Petri nets, hybrid automata, timed process algebra,max-plus algebra, pr- abilistic models).

The 16th annual International Conference on the Principles and Practice of Constraint Programming (CP 2010) was held in St. Andrews, Scotland, during September 6-10, 2010. We would like to thank our sponsors for their generous support of this event. This conference is concerned with all aspects of computing with constraints, including:theory,algorithms,applications,environments,languages,modelsand systems. We received a wide variety of submissions, each of which was reviewed by at least three referees. Referees were chosen for each submission by an initial bidding process where Program Committee members chose papers from their area of interest. The range of expertise represented by the large Program C- mittee meant that almost all submissions were reviewed by subject experts on the Program Committee, or by colleagues chosen by members of the Program Committee for their particular expertise. Papers weresolicitedeither as long (15 page), or short (8 page) submissions. Short-paper submissions were refereed to exactly the same high standards as long-paper submissions but naturally were expected to contain a smaller quantity of new material. Thus there is no disti- tion in these proceedings between short and long papers. I used the excellent EasyChair conference management system to support this process of reviewing, and for the collation and organization of these proceedings. Submissions were made either to the applications track or to the research track. Therewere101(23short)researchtracksubmissionsofwhich36(8short) wereaccepted,whichisa36%(35%ofshort)acceptancerate. Applicationstrack submissions received special consideration and the acceptance rate was sign- cantly higher than for the research track.

The ICMS Developer's Meeting is an international congress for which the main theme is mathematical software. The 2010 meeting was the third of a series of meetings of similar theme, the ?rst being held in Beijing, China in 2002,and the second in Castro-Urdiales, Spain in 2006. The ?eld of mathematics has numerous branches, and in each branch we ?nd that algorithms, and also implementations and applications of software s- tems, are studied. Researchers who endeavor to make such studies also have international meetings within their speci?c branches of mathematics, and these meetings have made signi?cant contributions to the ?elds in which they lie. The ICMS (International Congresseson Mathematical Software), on the other hand, is a general (not branch speci?c) meeting on mathematical software, which is held every four years, and is a rare opportunity for developers of mathematical softwarefrom di?erent branchesof mathematics, as well as mathematicians who are interested in mathematical software, to gather together.

This volume contains the 69 papers presented at the 16th Annual European Symposium on Algorithms (ESA 2010), held in Liverpool during September 6-8, 2010, including three papers by the distinguished invited speakers Artur Czumaj, Herbert Edelsbrunner, and Paolo Ferragina. ESA 2010 was organized as a part of ALGO 2010, which also included the 10th Workshop on Algorithms in Bioinformatics (WABI), the 8th Workshop on Approximation and Online Algorithms (WAOA), and the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS). The European Symposium on Algorithms covers research in the design, use, andanalysisofe?cientalgorithmsanddata structures.As inpreviousyears,the symposium had two tracks: the Design and Analysis Track and the Engineering and Applications Track, each with its own Program Committee. In total 245 papers adhering to the submission guidelines were submitted. Each paper was reviewed by three or four referees. Based on the reviews and the often extensive electronicdiscussionsfollowingthem, thecommittees selected 66papersintotal: 56 (out of 206) to the Design and Analysis Track and 10 (out of 39) to the Engineering andApplicationstrack.We believethat thesepaperstogethermade up a strong and varied program, showing the depth and breadth of current algorithms research.

This volume is conceived as a rami?cation of the eighth conference on Logic and the Foundations of the Theory of Games and Decisions (LOFT8), which took placein Amsterdam,inJuly2008.Inall,61papersweresubmitted to thisevent, of which 48 were presented. This volume is based on a selection of the presented papers and the invited talks: they survived a thorough and lengthy reviewing process. The LOFT conferences have been a regular biannual event since 1994. The ?rstconference washosted by the Centre Internationalde RecherchesMathe- tiques in Marseille (France),the next four took place at the InternationalCentre for Economic Research in Turin (Italy), the sixth conference was hosted by the Graduate School of Management in Leipzig (Germany), the seventh took place at the University of Liverpool (UK) and LOFT8 was organized at the ILLC in 1 Amsterdam. The LOFT conferences are interdisciplinary events that bring together - searchers from a variety of ?elds: computer science, economics, game theory, linguistics, logic, multi-agent systems, psychology, philosophy, social choice and statistics. Its focus is on the general issue of rationality and agency. In the last decade, there has been a ?oroushing activity in exactly the kind of areas that LOFT aims to address, which is demonstrated by not only the number of s- missions to LOFT8, but also the fact that the conference is becoming more and more a home for a large group of researchers, rather than a host for passersby from di?erent disciplines.

This volume contains the 69 papers presented at the 16th Annual European Symposium on Algorithms (ESA 2010), held in Liverpool during September 6-8, 2010, including three papers by the distinguished invited speakers Artur Czumaj, Herbert Edelsbrunner, and Paolo Ferragina. ESA 2010 was organized as a part of ALGO 2010, which also included the 10th Workshop on Algorithms in Bioinformatics (WABI), the 8th Workshop on Approximation and Online Algorithms (WAOA), and the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS). The European Symposium on Algorithms covers research in the design, use, andanalysisofe?cientalgorithmsanddata structures.As inpreviousyears,the symposium had two tracks: the Design and Analysis Track and the Engineering and Applications Track, each with its own Program Committee. In total 245 papers adhering to the submission guidelines were submitted. Each paper was reviewed by three or four referees. Based on the reviews and the often extensive electronicdiscussionsfollowingthem, thecommittees selected 66papersintotal: 56 (out of 206) to the Design and Analysis Track and 10 (out of 39) to the Engineering andApplicationstrack.We believethat thesepaperstogethermade up a strong and varied program, showing the depth and breadth of current algorithms research.

The CASC Workshops are traditionally held in turn in the Commonwealth of IndependentStates(CIS)andoutsideCIS(Germanyinparticular,but,attimes, also other countries with lively CA communities). The previous CASC Wo- shop was held in Japan, and the 12th workshop was held for the ?rst time in Armenia, which is one of the CIS republics. It should be noted that more than 35 institutes and scienti?c centers function within the National Academy of S- ences of Armenia (further details concerning the structure of the academy can be foundhttp://www. sci. am). These institutions are concerned, in particular, with problems in such branches of natural science as mathematics, informatics, physics, astronomy, biochemistry, etc. It follows from the talks presented at the previous CASC workshops that the methods and systems of computer algebra may be applied successfully in all the above-listed branches of natural sciences. Therefore, the organizers of the 12th CASC Workshop hope that the present workshop will help the Armenian scientists to become even more familiar with the capabilities of advanced computer algebra methods and systems and to get in touch with specialists in computer algebra from other countries. The 11 earlier CASC conferences, CASC 1998, CASC 1999, CASC 2000, CASC 2001, CASC 2002, CASC 2003, CASC 2004, CASC 2005, CASC 2006, CASC 2007, and CASC 2009 were held, respectively, in St. Petersburg (R- sia), Munich (Germany), Samarkand (Uzbekistan), Konstanz (Germany), Yalta (Ukraine), Passau (Germany), St.

Euro-Par is an annual series of international conferences dedicated to the p- motion and advancementof allaspects of parallelcomputing. The major themes can be divided into four broad categories: theory, high-performance, cluster and grid,distributedandmobilecomputing.Thesecategoriescomprise14topicsthat focus on particular issues. The objective of Euro-Paris to provide a forum within which to promote the development of parallel computing both as an industrial technique and an a- demic discipline, extending the frontier of both the state of the art and the state of practice. The main audience for and participants in Euro-Par are researchers inacademicdepartments,governmentlaboratories,andindustrialorganizations. Euro-Par2010 was the 16th conference in the Euro-Parseries, and was or- nizedbythe Institute forHigh-PerformanceComputingandNetworking(ICAR) of the Italian National Research Council (CNR), in Ischia, Italy. Previous Euro- ParconferencestookplaceinStockholm,Lyon,Passau,Southampton,Toulouse, Munich, Manchester, Padderborn, Klagenfurt, Pisa, Lisbon, Dresden, Rennes, Las Palmas, and Delft. Next year the conference will take place in Bordeaux, France. More information on the Euro-Par conference series and organization is available on the wesite http://www.europar.org. As mentioned before, the conference was organized in 14 topics. The paper review process for each topic was managed and supervised by a committee of at least four persons: a Global Chair, a Local Chair, and two members. Some speci?c topics with a high number of submissions were managed by a larger committeewithmoremembers.The?naldecisionsontheacceptanceorrejection ofthesubmitted papersweremadein ameeting ofthe ConferenceCo-chairsand Local Chairs of the topics.

This volume contains the papers presented at the 4th International Workshop on Reachability Problems, RP 2010 held during August 28-29, 2010 in the F- ulty of Informatics, Masaryk University, Brno, Czech Republic and co-located with Joint MFCS and CSL 2010 (35th InternationalSymposiums on Mathem- ical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). RP 2010 was the fourth in the series of workshops following three successful meetings at Ecole Polytechnique, France in 2009 at University of Liverpool, UK in 2008 and at Turku University, Finland in 2007. TheReachabilityProblemsworkshopsseriesaimsatgatheringtogethersch- ars from diverse disciplines and backgrounds interested in reachability problems that appearin algebraicstructures,computationalmodels, hybridsystems, logic and veri?cation, etc. Reachability is a fundamental problem in the context of many models and abstractions which describe various computational processes. Analysisofthecomputationaltracesandpredictabilityquestionsforsuchmodels can be formalized as a set of di?erent reachability problems. In general, reac- bility can be formulated as follows: Given a computational system with a set of allowed transformations (functions), decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in terms of some property as a parameterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations,unavoidability ofsomedynamicsandapossibilitytoavoidundesirabledynamicsusingalimited control.

This volume contains the papers presented at SAT 2010, the 13th International Conference on Theory and Applications of Satis?ability Testing. SAT 2010 was held as part of the 2010 Federated Logic Conference (FLoC) and was hosted by the School of Informatics at the University of Edinburgh, Scotland. In addition to SAT, FLoC included the conferences CAV, CSF, ICLP, IJCAR, ITP, LICS, RTA, as well as over 50 workshops. A?liated with SAT were the workshops LaSh (Logic and Search, co-a?liated with ICLP), LoCoCo (Logics for C- ponent Con?guration), POS (Pragmatics Of SAT), PPC (Propositional Proof Complexity: Theory and Practice), and SMT (Satis?ability Modulo Theories, co-a?liated with CAV). SAT featured three competitions: the MAX-SAT Ev- uation 2010, the Pseudo-Boolean Competition 2010, and the SAT-Race 2010. Many hard combinatorial problems such as problems arising in veri?cation and planning can be naturally expressed within the framework of propositional satis?ability. Due to its wide applicability and enormous progress in the perf- mance of solving methods, satis?ability has become one of today's most imp- tant core technologies. The SAT 2010 call for papers invited the submission of original practical and theoretical research on satis?ability. Topics included but were not limited to proof systems and proof complexity, search algorithms and heuristics, analysis of algorithms, combinatorial theory of satis?ability, random instances vs structured instances, problem encodings, industrial applications, applicationsto combinatorics,solvers,simpli?ers andtools,casestudies and- piricalresults,exactandparameterizedalgorithms.

This book constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. In total 21 papers were submitted and of those papers 13 were accepted as regular papers and a further 6 as extended abstracts. The papers are devoted to computational morphology, natural language processing, finite-state methods, automata, and related formal language theory.

This book constitutes the proceedings of the 11th International Workshop on Computational Logic in Multi-Agent Systems, CLIMA XI, held in Lisbon, Portugal, in August 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition 4 invited talks are presented. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational logic, for representing, programming and reasoning about agents and multi-agent systems in a formal way. This volume features two thematic special sessions: norms and normative multi-agent systems and logics for games and strategic reasoning.

Yuri Gurevich has played a major role in the discovery and development of - plications of mathematical logic to theoretical and practical computer science. His interests have spanned a broad spectrum of subjects, including decision p- cedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. In May 2010, Yuri celebrated his 70th birthday. To mark that occasion, on August 22, 2010,a symposium was held in Brno, the Czech Republic, as a sat- lite event of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) and of the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010). The meeting received generous support from Microsoft Research. In preparation for this 70th birthday event, we asked Yuri's colleagues (whether or not they were able to attend the symposium) to contribute to a volume in his honor. This book is the result of that e?ort. The collection of articles herein begins with an academic biography, an annotated list of Yuri's publications and reports, and a personaltribute by Jan Van den Bussche. These are followed by 28 technical contributions. These articles - though they cover a broad range of topics - represent only a fraction of Yuri's multiple areas of interest. Each contribution was reviewed by one or two readers. In this regard, the editors wish to thank several anonymous individuals for their assistance.

Veri?ed Software: Theories, Tools and Experiments, VSTTE 2010, was held in Edinburgh, Scotland during August 16-19, 2010. This conference is part of the Veri?ed Software Initiative (VSI), which is a 15-year international project that focuses on the scienti?c and technical challenges of producing veri?ed software. Previous VSTTE conferences were held in Zurich, Switzerland (in 2005) and Toronto, Canada (in 2008). The goal of VSTTE 2010 was to advance the state of the art in the science andtechnologyofsoftwareveri?cationthroughtheinteractionoftheorydevel- ment,toolevolution,andexperimentalvalidation.Theacceptedpapersrepresent work on veri?cation techniques, speci?cation languages, formal calculi, veri?- tion tools, solutions to challenge problems, software design methods, reusable components, re?nement methodologies, and requirements modeling. Several of the accepted papers also presented case studies, either in response to published challenge problems or problems of practical interest. Many of the papers were also concerned with concurrent programs. Asspeci?edinthecallforpapers,authorssubmitted15-pagepaperselectr- ically. The EasyChair system handled submissions and was used to manage the reviewing of papers and subsequent discussion. This system aided the Program Committee in avoiding con?icts of interest during the reviewing and discussion process. There was electronic discussion among the Program Committee m- bersaboutthemeritsofeachsubmission,moderatedbytheProgramCommittee Co-chairs. This year the conference received 32 submissions, of which 11 were accepted, for an acceptance rate of about 34%. Seven of the accepted papers were - authored by members of the Program Committee. We were pleased to have invited talks by Tom Ball, Gerwin Klein, and Matthew Parkinson.The authorsof these invitedtalks also graciouslyconsented to the publication of accompanying invited papers in this volume.

TheAssociationforMathematicsofLanguage(MOL)istheACLspecialinterest groupdedicated to the study of MathematicalLinguistics. After its ?rst meeting in 1984, the association has been organizing meetings on a biennial basis since 1991, with locations usually alternating between Europe and the USA. This volume contains a selection of 19 papers that were presented in c- tributed talks at the 10th meeting at UCLA, Los Angeles, in 2007 and the 11th meetingattheUniversityofBielefeld,Germany,in2009. Itfurthermorecontains threepapersofinvitedspeakersfromthesemeetings. LikeeachMOLproceedings volume, this collection re?ects studies in a wide range of theoretical topics rel- ing to language and computation that the association is devoted to supporting, including papers on the intersection of computational complexity, formal l- guage theory, proof-theory, and logic as well as phonology, lexical semantics, syntax, and typology. This volume is hence of interest not only to mathem- ical linguists but to logicians, theoretical and computational linguists, and to computer scientists alike. It therefore ?ts very well in the Springer FoLLI/LNAI series and we are grateful to Michael Moortgat for suggesting this series as a place of publication. We would furthermore like to thank everyone who played a role in making thesemeetingspossibleandhelpedtomakethemasuccess,suchasthereviewers, the invited speakers,the contributors,and the people who were involvedin local organization. May 2010 Christian Ebert Gerhard Jager .. Jens Michaelis Organization MOL10washeldattheUniversityofCalifornia,LosAngeles,duringJuly28-30, 2007. LocalOrganizers Marcus Kracht University of California, Los Angeles Gerald Penn University of Toronto Edward P.