This volume is devoted to the 10th Anniversary Colloquium of UNU/IIST, the International Institute for Software Technology of the United Nations University, as well as to the memory of Armando Haeberer, who passed away while he was working on the preparation of this book in February 2003. The volume starts with a special paper by Tom Maibaum recollecting Armando Haeberer's life and work. The second part presents work done by members of UNU/IIST as well as a paper on the history of the institute. The subsequent topical sections present key contributions by leading researchers and thus assess the state of the art in software engineering and its engineering and scientific principles, from models to software, real-time systems, and verification. All in all, the book is a unique survey of the power and potential of formal methods in software engineering.

By presenting state-of-the-art research results on various aspects of formal and visual modeling of software and systems, this book commemorates the 60th birthday of Hartmut Ehrig. The 24 invited reviewed papers are written by students and collaborators of Hartmut Ehrig who are established researchers in their fields. Reflecting the scientific interest and work of Hartmut Ehrig, the papers fall into three main parts on graph transformation, algebraic specification and logic, and formal and visual modeling.

ThisvolumecontainstheproceedingsofFM2003,the12thInternationalFormal Methods Europe Symposium which was held in Pisa, Italy on September 8–14, 2003. Formal Methods Europe (FME, www. fmeurope. org) is an independent - sociation which aims to stimulate the use of and research on formal methods for system development. FME conferences began with a VDM Europe symposium in 1987. Since then, the meetings have grown and have been held about once - ery 18 months. Throughout the years the symposia have been notably successful in bringing together researchers, tool developers, vendors, and users, both from academia and from industry. Unlike previous symposia in the series, FM 2003 was not given a speci?c theme. Rather, its main goal could be synthesized as “widening the scope. ” Indeed, the organizers aimed at enlarging the audience and impact of the symposium along several directions. Dropping the su?x ‘E’ from the title of the conference re?ects the wish to welcome participation and contribution from every country; also,contributionsfromoutsidethetraditionalFormalMethodscommunitywere solicited. The recent innovation of including an Industrial Day as an important part of the symposium shows the strong commitment to involve industrial p- ple more and more within the Formal Methods community. Even the traditional and rather fuzzy borderline between “software engineering formal methods” and methods and formalisms exploited in di?erent ?elds of engineering was so- what challenged.

This book presents the refereed proceedings of the 15th International Symposium on Formal Methods, FM 2008, held in Turku, Finland in May 2008. The 23 revised full papers presented together with 4 invited contributions and extended abstracts of 5 invited industrial presentations were carefully reviewed and selected from 106 submissions. The papers are organized in topical sections on programming language analysis, verification, real-time and concurrency, grand chellenge problems, fm practice, runtime monitoring and analysis, communication, constraint analysis, and design.

This Festschrift volume is published to honour both Dines Bjørner and Zhou Chaochen on the occasion of their 70th birthdays. The volume includes 25 refereed papers by leading researchers, current and former colleagues, who congregated at a celebratory symposium held in Macao, China, in the course of the International Colloquium on Theoretical Aspects of Computing, ICTAC 2007. The papers cover a broad spectrum of subjects.

Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"

This book presents 19 revised invited keynote lectures and revised tutorial lectures given at the 4th International Symposium on Formal Methods for Components and Objects, FMCO 2005, Amsterdam, November 2005. The book provides a unique combination of ideas on software engineering and formal methods that reflect the current interest in the application or development of formal methods for large scale software systems such as component-based systems and object systems.