In recent years, model checking has become an essential technique for the formal verification of systems. With a clarity of presentation and its many illuminating examples, this book makes this technical material easy to grasp. It is perfectly suited for an advanced undergraduate or graduate class in formal verification and will serve as a valuable resource to practitioners of formal methods.

This collection of essays reflects the breadth of research in computer science. Following a biography of Robin Milner it contains sections on semantic foundations; programming logic; programming languages; concurrency; and mobility.

This book constitutes the refereed proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2002, held in Milovy, Czech Republic, in November 2002. The volume presents 10 invited lectures and the report on a panel discussion on GRID computing together with 11 revised full papers selected from 22 submissions. Among the topics covered are system design and testing related theory, distributed and parallel systems, type theory, multimedia, databases, computer vision, and soft computing.

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

This book contains thoroughly refereed and revised papers from the 8th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2011, held in Akademgorodok, Novosibirsk, Russia, in June/July 2011. The 18 revised full papers and 10 revised short papers presented were carefully reviewed and selected from 60 submissions. The volume also contains 5 invited papers covering a range of hot topics in computer science and informatics. The papers are organized in topical sections on foundations of program and system development and analysis, partial evaluation, mixed computation, abstract interpretation, compiler construction, computer models and algorithms for bioinformatics, programming methodology and software engineering, information technologies, knowledge-based systems, and knowledge engineering.

This book constitutes the refereed proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2009, held in York, UK, in March 2009, as part of ETAPS 2009, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with two invited talks were carefully reviewed and selected from 102 full paper submissions. The topics addressed are semantics, logics and automata, algebras, automata theory, processes and models, security, probabilistic and quantitative models, synthesis, and program analysis and semantics.

Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.

This book constitutes the refereed proceedings of the First European Workshop on Software Architecture, EWSA 2004, held in St Andrews, Scotland, UK in May 2004 in conjunction with ICSE 2004. The 9 revised full research papers, 4 revised full experience papers, and 6 revised position papers presented together with 5 invited presentations on ongoing European projects on software architectures were carefully reviewed and selected from 48 submissions. All current aspects of software architectures are addressed ranging from foundational and methodological issues to application issues of practical relevance.

This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2009, held in Bologna, Italy, September 1-4, 2009. The 37 revised full papers presented together with four invited papers were carefully reviewed and selected from 129 submissions. The topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.

Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material not normally covered in a beginner's course in automata theory, and then rapidly moves on to applications. The book is largely devoted to verification and model checking, and contains material that is at the cutting edge of verification technology. It will be an invaluable reference for software practitioners working in this area.