Rigorous Methods for Software Construction and Analysis: Essays Dedicated to Egon Börger on the Occasion of His 60th Birthday (Lecture Notes in Computer Science)

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.

This Festschrift volume, published in honor of Egon Börger, contains 14 papers from a Dagstuhl Seminar, which was organized as a "Festkolloquium" on the occasion of his 60th birthday in May 2006. Focusing on applied formal methods, the volume covers a wide range of applied research, spanning from theoretical and methodological foundations to practical applications of Abstract State Machines, B, and beyond, emphasizing universal methods and tools that, regardless of their applicational orientation, are still committed to the ideal of mathematical rigor.

In particular, the papers address the following central topics: methodological foundations of requirements specification and verification, characterization of specification languages and their logical foundations, advanced tool environments and systematic integration of tools, machine assisted validation and verification, distributed algorithms and concurrent protocols, novel applications in public safety, security and privacy, industrial case studies and experience reports, and the role of formal methods in computer science education.