A practical text suitable for an introductory or advanced course in formal methods, this book presents a mathematical approach to modelling and designing systems using an extension of the B formal method: Event-B. Based on the idea of refinement, the author's systematic approach allows the user to construct models gradually and to facilitate a systematic reasoning method by means of proofs. Readers will learn how to build models of programs and, more generally, discrete systems, but this is all done with practice in mind. The numerous examples provided arise from various sources of computer system developments, including sequential programs, concurrent programs and electronic circuits. The book also contains a large number of exercises and projects ranging in difficulty. Each of the examples included in the book has been proved using the Rodin Platform tool set, which is available free for download at www.event-b.org.

This book, with the CD-ROM included, is the documentation of a unique collaborative effort in evaluating formal methods for usage under industrial constraints: the major techniques for formally supported specification, design, and verification of large programs and complex systems are applied to a non-trivial and non-academic problem which is typical for industrial informal requirements specifications.
The 21 papers included in the book, together with an introduction and competition report, were selected from 33 candidate solutions. This book comes with a CD-ROM containing, besides the printed papers, executable code, full definitions of all parts of the specifications, and detailed descriptions of foundational matters where appropriate.

Egon B.. orger Tribute to Egon B.. orger on th the Occasion of his 60 Birthday 1 2 Jean-Raymond Abrial and Uwe Glasser .. 1 jrabrial@neuf. fr 2 glaesser@cs. sfu. ca Egon B.. orger was born on May 13, 1946, in Westfalia (Germany). After the cl- sic baccalaur' eat, from 1965-1971 he studied philosophy, logic and mathematics at the Sorbonne (Paris, France), Institut Sup' erieur de Philosophie de Louvain (Belgium), Universit' e de Louvain and Universitat .. Munster .. (Germany), where he got his doctoral degree and in 1976 his "Habilitation" in mathematics. The themes of his doctoral dissertation,ReductionclassesinKromandHornfor- lae,andofhis"Habilitationsschrift,"Asimple method for determining thedegree of unsolvability of decision problems for combinatorial systems,havetheirroot inthe computationalviewofmathematicallogicheldatthe time atthe Institute for Logic and Foundations of Mathematics at the University of Mu ..nster, a t- dition going back to (among others) Leibniz, Ackermann, G.. odel, Post, Turing, Kleene, and associated in Munster .. with the names of the founder of the ins- tute, Heinrich Scholz, and his followers Hans Hermes, Gisbert Hasenj. ager and Dieter R.. odding. This heritage determined the focus of B.. orger's logical inves- gations in what nowadaysis called computability and computationalcomplexity theory and his early interest in applying methods from logic to solve problems in computer science.