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.

The Pernambuco School on Software Engineering (PSSE) 2007 was the second in a series of events devoted to the study of advanced computer science and to the promotion of international scienti?c collaboration. The main theme in 2007 was testing. Testing is nowadays a key activity for assuring software quality. The summer school and its proceedings were intended to give a detailed tutorial introduction to the scienti?c basis of this activity and its state of the art. Theseproceedingsrecordthecontributionsfromtheinvitedlecturers.Eachof thechaptersistheresultofathoroughrevisionoftheinitialnotesprovidedtothe participants of the school. The revision was inspired by the synergy generated by the opportunity for the lecturers to present and discuss their work among themselves and with the school s attendees. The editors have tried to produce a coherent view of the topic by harmonizing these contributions, smoothing out di?erences in notation and approach, and providing links between the lectures. We apologize to the authors for any errors introduced by our extensive editing. Although the chapters are linked in severalways, each one is su?ciently se- contained to be read in isolation. Nevertheless, Chap. 1 should be read ?rst by those interested in an introduction to testing. Chapter 1 introduces the terminology adopted in this book. It also provides an overview of the testing process, and of the types (functional, structural, and so on)anddimensions(unit, integration, andsoon)ofthetestingactivity.Themain strategies employed in the central activity of test selection are also discussed. Most of the material presented in this introductory chapter is addressedin more depth in the following chapters."

The 14th International Conference on Developments in Language Theory (DLT 2010) was held in London, Ontario, Canada on the beautiful campus of the University of Western Ontario. It was a four-day conference starting August 17 and ending August 20, 2010. The DLT conference series is one of the major international conference series in language theory. It started in Turku, Finland in 1993. Initially, it was held onceeverytwoyears. Since2001,ithasbeenheldeveryyear,oddyearsinEurope and even years in other continents. The papers submitted to DLT 2010 were from 27 countries all over the world, which include Australia, Austria, Belgium, Canada, Czech Republic, Denmark, Finland, France, Germany, Hungary, Iceland, India, Italy, Japan, Latvia, Moldova, The Netherlands, Poland, Portugal, Russian Federation, S- vakia, South Korea, Spain, Sweden, Tunisia, UK, and the USA. Each paper was reviewed by three referees and discussed by the members of the Program C- mittee. Finally, 32 regular papers were selected by the Program Committee for presentation at the conference. There were six invited talks given at the c- ference. They were given by (in alphabetic order) Dora Giammarresi (Rome), MarkusHolzer (Giessen), OscarIbarra(Santa Barbara),Lila Kari(London,- tario), Michel Rigo (Liege), and Grzegorz Rozenber (Leiden). In addition, there were six posters on display at the conference. This volume includes all the 32 contributed papers, the papers or abstracts from the 6 invited speakers, and a 2-page abstract for each of the 6 poster papers. Wewarmlythankalltheinvitedspeakersandalltheauthorsofthesubmitted papers. Their e?orts were the bases of the success of the conference.

This book constitutes the thoroughly refereed proceedings of the Second Int- national Symposium on Unifying Theories of Programming, UTP 2008, held at Trinity College, Dublin, Ireland, in September 2008. This symposium followed on the success of the ?rst held at Walworth Castle in 2006. Based on the pioneering work on unifying theories of programming of Tony Hoare, He Jifeng, and others, the aims of this symposium series are to continue to rea?rm the signi?cance of the ongoing UTP project, to encourage e?orts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise awareness of the bene?ts of such a unifying theoretical framework among the wider computer science and software engineering communities. There were two invited talks, one of which appears here in full, the other in abstractform.We wouldliketo warmlythank bothJifengHe andRalph-Johann Back for their enthusiastic and engaged participation in this event.

It is our great pleasure to present the proceedings of the second Russia-Taiwan Symposium on Methods and Tools of Parallel Programming (MTPP 2010). MTPP is the main regular event of the Russia-Taiwan scientific forum that covers the many dimensions of methods and tools of parallel programming, algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated every aspect of daily life, the power of computing systems has become increasingly critical. Therefore, MTPP is intended to play an important role allowing researchers to exchange information regarding advancements in the state of the art and practice of IT-driven services and applications, as well as to identify emerging research topics and define the future directions of parallel computing. We received a large number of high-quality submissions this year. In the first stage, all papers submitted were screened for their relevance and general submission requirements. These manuscripts then underwent a rigorous peer-review process with at least three reviewers per paper. At the end, 33 papers were accepted for presentation and included in the main proceedings. To encourage and promote the work presented at MTPP 2010, we are delighted to inform the authors that some of the papers will be accepted in special issues of the Journal of Supercomputing, which has played a prominent role in promoting the development and use of parallel and distributed processing.

This volume presents the set of papers accompanying some of the lectures of the 10th International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience as a prominent approachto the rigorousdesign of the above-mentionedsystems. 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 2010 was devoted to formal methods for quantitative aspects of p- gramminglanguagesandcoveredseveraltopicsincludingprobabilisticandtimed models, model checking, static analysis, quantum computing, real-time and - bedded systems, and security. This volume comprises four articles. The paper by Di Pierro, Hankin, and Wiklicky investigates the relation between the operational semantics of pro- bilistic programming languages and discrete-time Markov chains and presents a framework for probabilistic program analysis inspired by classical abstract interpretation. Broadbent, Fitzsimons, and Kashe? review the mathematical model underlying measurement-based quantum computation, a novel approach to quantum computation where measurement is the main driving force of c- putation instead of the unitary operations of the more traditional quantum c- cuit model. The paper by Malacaria and Heusser illustrates the informati- theoretical basis of quantitative information ?ow by showing the relationship betweenlattices,partitions,andinformation-theoreticalconcepts,aswellastheir applicabilitytoquantifyleakageofcon?dentialinformationinprograms. Finally, Wolter and Reinecke discuss the trade-o? between performance and security by formulating metrics that explicitly express the trade-o? and by showing how to ?nd system parameters that optimize those metrics.

Controlled natural languages (CNLs) are subsets of natural languages, obtained by - stricting the grammar and vocabulary in order to reduce or eliminate ambiguity and complexity. Traditionally, controlled languagesfall into two major types: those that - prove readability for human readers, and those that enable reliable automatic semantic analysis of the language. [. . . ] The second type of languages has a formal logical basis, i. e. they have a formal syntax and semantics, and can be mapped to an existing formal language, such as ?rst-order logic. Thus, those languages can be used as knowledge representation languages, and writing of those languages is supported by fully au- matic consistency and redundancy checks, query answering, etc. Wikipedia Variouscontrollednatural languagesof the second type have been developedby a n- ber of organizations, and have been used in many different application domains, most recently within the Semantic Web. The workshop CNL 2009 was dedicated to discussing the similarities and the d- ferences of existing controlled natural languages of the second type, possible impro- ments to these languages, relations to other knowledge representation languages, tool support, existing and future applications, and further topics of interest.

Volume XII of the Transactions on Rough Sets (TRS) includes articles that are part of a special issue on Rough Set Structuring of Knowledge. These articles are extended versions of papers accepted for presentation at the Rough Set and Knowledge Technology Conference (RSKT 2008) organized in Chengdu, China, in May 2008. In fact, this conference did not take place because of the earthquake that dramatically hit the Chengdu province just before the event. The editors selected some papers accepted for RSKT 2008 and invited their authors to submit extended versions to this issue. The 11 submissions received after this invitation were sent to reviewers and, ?nally, 8 papers were accepted for publication in the special issue. The editors of the special issue are particularly grateful to all the authors of submitted papers, and to the editors of Transactions on Rough Sets,JamesF. Peters and Andrzej Skowron, who provided friendly and valuable assistance in the reviewing process. Special thanks are due to the following reviewers: Mohua Banerjee, Anna Gomolinsk ' a, Ryszard Janicki, Julia Johnson, Maneesh Joshi, Jusheng Mi, Sonajharia Minz, Sushmita Mitra, Tuan Trung Nguyen, Georg Pe- ' ters, Andrzej Skowron, Genlou Sun, Marcin Szczuka, Dominik Sl, ezak, Guoyin Wang, Hai Wang, Marcin Wolski, Haiyi Zhang, Yan Zhao, William Zhu. Their laudable e?orts made possible a careful selection and revision of submitted manuscripts.

th The 15 edition of the International Conference on Reliable Software Te- nologies - Ada-Europe 2010-took place in the attractive venue of Valencia, deservedly making Spain the most visited country in the conference series. P- vious editions of the conference were held in Switzerland (Montreux 1996 and Geneva2007),United Kingdom(London1997andYork2005),Sweden(Uppsala 1998),Spain(Santander 1999andPalmade Mallorca2004),Germany(Potsdam 2000), Belgium (Leuven 2001), Austria (Vienna 2002), France (Toulouse 2003 and Brest 2009), Portugal (Porto 2006), and Italy (Venice 2008). Theconferencerepresentsthe mainyearlyeventpromotedbyAda-Europe,in cooperation with ACM SIGAda. This third visit to Spain acknowledges the fact that Ada-Spainisthe largestnationalassociationof Ada-Europe,andis a major contributor to Ada-Europe's activities. This year the conference was organized by members of the Instituto de Automat ' ica e Informa 'tica Industrial (AI2) and the Departamento de Inform' atica de Sistemas y Computadores (DISCA) of the Universidad Polit' ecnica de Valencia. Theyear2010isimportantforAda:thisistheyearwhenthenewamendment to the language (known as Ada 2012) is taking its de?nitive shape. The conf- ence program was not unaware of this fact, and these proceedings re?ect it by including papers about multicore programming in Ada, along with an overview of the key elements of the Ada 2012 amendment in the making. The scienti?c program of the conference, which feeds these proceedings, also included sessions devoted to software dependability, critical, real-time and d- tributed systems, and language technology, all under the more general heading of "Reliable Software Technologies." This program is the result of a thorough selectionprocessof17submissionsoutof42receivedfromauthorsof19di?erent countries.

th The 18 International Conference on Conceptual Structures (ICCS 2010) was the latest in a series of annual conferences that have been held in Europe, A- tralia, and North America since 1993. The focus of the conference has been the representation and analysis of conceptual knowledge for research and practical application. ICCS brings together researchers and practitioners in information and computer sciences as well as social science to explore novel ways that c- ceptual structures can be deployed. Arising from the research on knowledge representation and reasoning with conceptual graphs, over the years ICCS has broadened its scope to include in- vations from a wider range of theories and related practices, among them other forms of graph-based reasoning systems like RDF or existential graphs, formal concept analysis, Semantic Web technologies, ontologies, concept mapping and more. Accordingly, ICCS represents a family of approaches related to conc- tualstructuresthatbuild onthesuccesseswithtechniquesderivedfromarti?cial intelligence, knowledge representation and reasoning, applied mathematics and lattice theory, computational linguistics, conceptual modeling and design, d- grammatic reasoning and logic, intelligent systems and knowledge management. The ICCS 2010 theme "From Information to Intelligence" hints at unve- ing the reasoning capabilities of conceptual structures. Indeed, improvements in storage capacity and performance of computing infrastructure have also - fected the nature of knowledge representation and reasoning (KRR) systems, shifting their focus toward representational power and execution performance. Therefore, KRR research is now faced with a challenge of developing knowledge representation and reasoning structures optimized for such reasonings.

Wearepleasedtopresenttheproceedingsofthe8thInternationalConferenceon Parallel Processing and Applied Mathematics - PPAM 2009, which was held in Wroc law, Poland, September 13-16, 2009. It was organized by the Department ofComputer andInformationSciencesof theCzestochowaUniversity ofTechno- logy,withthehelpoftheWroc lawUniversityofTechnology,FacultyofComputer Science and Management. The main organizer was Roman Wyrzykowski. PPAM is a biennial conference. Seven previous events have been held in di?erentplacesinPolandsince1994.Theproceedingsofthelastfourconferences havebeenpublishedbySpringerintheLectureNotes in Computer Science series (Nal ecz' ow, 2001,vol.2328;Czestochowa,2003,vol.3019;Poznan ', 2005,vol.3911; Gdan 'sk, 2007, vol. 4967). The PPAM conferences have become an international forum for exchanging ideasbetweenresearchersinvolvedinparallelanddistributedcomputing,incl- ing theory and applications, as well as applied and computational mathematics. The focus of PPAM 2009 was on models, algorithms, and software tools which facilitate e?cient and convenient utilization of modern parallel and distributed computing architectures, as well as on large-scale applications. Thismeeting gatheredmorethan210participantsfrom 32countries.A strict refereeing process resulted in the acceptance of 129 contributed presentations, while approximately46% of the submissionswere rejected. Regular tracksof the conference covered such important ?elds of parallel/distributed/grid computing and applied mathematics as: - Parallel/distributed architectures and mobile computing - Numerical algorithms and parallel numerics - Parallel and distributed non-numerical algorithms - Tools and environments for parallel/distributed/grid computing - Applications of parallel/distributed computing - Applied mathematics and neural networks Plenary and Invited Speakers The plenary and invited talks were presented by: - Srinivas Aluru from the Iowa State University (USA) - Dominik Behr from AMD (USA) - Ewa Deelman from the University of Southern California (USA) - Jack Dongarra from the University of Tennessee and Oak Ridge National

ANTS-IX was the ninth edition of the biennial International Symposium on Algorithmic Number Theory. The ?rst edition of this symposium was held at Cornell University in 1994. ANTS-IX was held July 19-23, 2010 at INRIA in Nancy, France. The ANTS-IX Program Committee consisted of 12 members whose names are listed on the next page. The selection of the accepted papers among the submissions was made from mid-January to end of March 2010. Each paper was thoroughly reviewed by at least two experts, including a Program Committee member. The Program Committee selected 25 high-quality articles, which are excellent representatives of the current state of the art in various areas of - gorithmic number theory. The Selfridge Prize in computational number theory was awarded to the authors of the best contributed paper presented at the c- ference. We gratefully thank the authors of all submitted papers for their hard work which made the selection of a varied program possible. We also thank the authors of the accepted papers for their cooperation in the timely production of the revised versions. Each submitted paper was presented by one of its co-authors at the c- ference. Besides contributed papers, the conference included ?ve invited talks by Henri Darmon (McGill University), Jean-Fran, cois Mestre (Universit'eParis 7), Gabriele Nebe (RWTH Aachen), Carl Pomerance (Dartmouth College), and Oded Regev (Tel-Aviv University).

This volume contains the papers presented at ITP 2010: the First International ConferenceonInteractiveTheoremProving. It washeldduring July11-14,2010 in Edinburgh, Scotland as part of the Federated Logic Conference (FLoC, July 9-21, 2010) alongside the other FLoC conferences and workshops. ITP combines the communities of two venerable meetings: the TPHOLs c- ference and the ACL2 workshop. The former conference originated in 1988 as a workshop for users of the HOL proof assistant. The ?rst two meetings were at the University of Cambridge, but afterwards they were held in a variety of venues. By 1992, the workshop acquired the name Higher-Order Logic Theorem Proving and Its Applications. In 1996, it was christened anew as Theorem Pr- ing in Higher-Order Logics, TPHOLs for short, and was henceforth organizedas a conference. Each of these transitions broadened the meeting's scope from the original HOL system to include other proof assistants based on forms of high- order logic, including Coq, Isabelle and PVS. TPHOLs has regularly published research done using ACL2 (the modern version of the well-known Boyer-Moore theorem prover), even though ACL2 implements a unique computational form of ?rst-order logic. The ACL2 community has run its own series of workshops since1999. BymergingTPHOLswith the ACL2workshop,weinclude a broader community of researchers who work with interactive proof tools. With our enlarged community, it was not surprising that ITP attracted a record-breaking 74 submissions, each of which was reviewed by at least three Programme Committee members.

This volume presents the papers contributed to ?EON 2008, the 10th Int- national Conference on Deontic Logic in Computer Science, held in Fiesole (Florence), July 7-9, 2010. This biennial conference series is designed to p- mote international cooperation amongst scholars who are interested in deontic logic and its use in computer science. The scope of the conference is interd- ciplinary, it covers formal-logical studies of normative concepts and normative systems and their links with computer science, arti?cial intelligence, philosophy, organization theory, and law. This edition of ?EON invited submission on the following general themes: the logical study of normative reasoning, including formal systems of deontic logic, defeasible normative reasoning, the logic of action, and other related - eas of logic, the formal analysis of normative concepts and normative systems, the formal representation of legal knowledge, the formal speci?cation of aspects of norm-governed multi-agent systems and autonomous agents, including (but not limited to) the representation of rights, authorization, delegation, power, responsibility and liability, the formal speci?cation of normative systems for the managementofbureaucraticprocessesinpublic orprivateadministration,app- cations of normative logic to the speci? cation of database integrity constraints, normative aspects of protocols for communication, negotiation and multi-agent decision making.In particular,submissions weresolicited addressingapplication of deontic notions for modelling legal systems.

This volume contains the proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010). IJCAR 2010 was held during July 16-19 as part of the 2010 Federated Logic Conference, hosted by the School of Informatics at the University ofEdinburgh,Scotland. Support by the conference sponsors - EPSRC, NSF, Microsoft Research, Association for Symbolic Logic, CADE Inc. , Google, Hewlett-Packard, Intel - is gratefully acknowledged. IJCARisthepremierinternationaljointconferenceonalltopicsinautomated reasoning, including foundations, implementations, and applications. Previous IJCAR conferences were held at Siena (Italy) in 2001, Cork (Ireland) in 2004, Seattle (USA) in 2006, and Sydney (Australia) in 2008. IJCAR comprises s- eral leading conferences and workshops. In 2010, IJCAR was the fusion of the following events: -CADE: International Conference on Automated Deduction -FroCoS: International Symposium on Frontiers of Combining Systems -FTP: International Workshop on First-Order Theorem Proving - TABLEAUX: InternationalConferenceonAutomatedReasoningwith- alytic Tableaux and Related Methods There were 89 submissions (63 regular papers and 26 system descriptions) of which 40 were accepted (28 regular papers and 12 system descriptions). Each submission was assigned to at least three Program Committee members, who carefully reviewed the papers, with the help of 92 external referees. Afterwards, the submissions were discussed by the ProgramCommittee during two weeks by means of Andrei Voronkov's EasyChair system. We want to thank Andrei very much for providing his system, which was very helpful for the management of the submissions and reviews and for the discussion of the Program Committee.

This volume contains the proceedings of the 22nd International Conference on Computer-Aided Veri?cation (CAV) held in Edinburgh, UK, July 15-19 2010. CAV is dedicated to the advancement of the theory and practice of comput- assistedformalanalysismethods forsoftwareandhardwaresystems.Theconf- ence covers the spectrum from theoretical results to concrete applications, with an emphasis on practical veri?cation tools and the algorithms and techniques that are needed for their implementation. We received 145 submissions: 101 submissions of regular papers and 44 s- missions of tool papers. These submissions went through a meticulous review process;eachsubmissionwasreviewedbyatleast 4,andonaverage4.2 Program Committee members. Authors had the opportunity to respond to the initial - views during an author response period. This helped the Program Committee members to select 51 papers: 34 regular papers and 17 tool papers. In addition to the accepted papers, the program also included: - Five invited talks: * Policy Monitoring in First-Order Temporal Logic, by David Basin (ETH Zurich) * Retro?tting Legacy Code for Security, by Somesh Jha (University of Wisconsin-Madison) * Induction, Invariants, and Abstraction, by Deepak Kapur (University of New Mexico) * Quantitative Information Flow: From Theory to Practice? by Pasquale Malacaria (Queen Mary University) and * Memory Management in Concurrent Algorithms, by Maged Michael (IBM) - Four invited tutorials: * ABC: An Academic Industrial-Strength Veri?cation Tool, by Robert Brayton (University of California, Berkeley) * SoftwareModelChecking,byKennethMcMillan(CadenceBerkeleyLabs) * There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code, by Thomas Reps (University of Wisconsin-Madison) and

Model transformations are the glue that tie modelling activities together. If you've used modelling in anger then, whether you know it or not, you've used model transformations. They come in all shapes and sizes from moving models between di?erent tools to generating implementations. Model transformations have humble beginnings-at one point, not long ago, it was said by many 'in the know' that the way forward in model transformations was to use XSLT. That this idea now raises a wry smile shows how far the model transformation community has come in a short time. Where once model transformations were hacked together in a variety of unsuitable languages, we now have a number of powerful, dedicated languages and theories at our disposal. Since 2008, the ICMT conference series has played a huge part in advancing the subject, and this third edition was no di?erent. The theories and languages presented at ICMT have allowed principled model transformations to play an ever greater part in real systems. Of course there is still much more to do: we need our model transformations, languages, and theories to scale further, allow greater expressivity, be more ?exible, and aid reusability; and we lack empirically backed studies of model transformations in use. Doubtless you can think of other gaps. Yet, though some real-world challenges lie just beyond our reach,eachyearseesonce-dauntingproblemsconquered.Muchofthatprogressis nowdriven byICMT, andthis year'sedition showedhow model transformations are increasingly being used in previously unfamiliar areas.