This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.

This book constitutes the Proceedings of the IFIP Working Conference PRO COMET'98, held 8-12 June 1998 at Shelter Island, N.Y. The conference is organized by the t'wo IFIP TC 2 Working Groups 2.2 Formal Description of Programming Concepts and 2.3 Programming Methodology. WG2.2 and WG2.3 have been organizing these conferences every four years for over twenty years. The aim of such Working Conferences organized by IFIP Working Groups is to bring together leading scientists in a given area of computer science. Participation is by invitation only. As a result, these conferences distinguish themselves from other meetings by extensive and competent technical discus sions. PROCOMET stands for Programming Concepts and Methods, indicating that the area of discussion for the conference is the formal description of pro gramming concepts and methods, their tool support, and their applications. At PROCOMET working conferences, papers are presented from this whole area, reflecting the interest of the individuals in WG2.2 and WG2.3.

The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The topics of Hoare Logic and the Refinement Calculus are introduced and a general theory of simulations is developed and related to them. Accessibility and comprehension are emphasized in order to guide newcomers to the area. The book's second part contains a detailed survey of important methods in this field, such as VDM, and the methods due to Abadi & Lamport, Hehner, Lynch and Reynolds, Back's refinement calculus and Z. All these methods are carefully analysed, and shown to be either imcomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analyzed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation.

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more emphasis on specification, modelling and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programming languages.

This book presents 12 revised lectures given by top-researchers at the 5th International Symposium on Formal Methods for Components and Objects, FMCO 2006, held in Amsterdam, Netherlands, in November 2006. 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. The papers are organized in topical sections on component and service oriented computing, system design, tools, algebraic methods, model checking, assertional methods, and quantitative analysis.

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more emphasis on specification, modelling and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programming languages.

This book presents 19 revised invited keynote lectures and revised tutorial lectures given by top-researchers at the 4th International Symposium on Formal Methods for Components and Objects, FMCO 2005, held in Amsterdam, Netherlands, in 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. The papers are organized in topical sections on component and service oriented computing, system design, tools, algebraic methods, model checking, assertional methods, quantitative analysis.

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more emphasis on specification, modelling and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programming languages.

This book presents revised tutorial lectures given by invited speakers at the Third International Symposium on Formal Methods for Components and Objects, FMCO 2004, held in Leiden, The Netherlands, in November 2004. The 14 revised lectures by leading researchers present a comprehensive account of the potential of formal methods applied to large and complex software systems such as component-based systems and object systems. The book provides an unique combination of ideas on software engineering and formal methods that reflect the expanding body of knowledge on modern software systems.

The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The topics of Hoare Logic and the Refinement Calculus are introduced and a general theory of simulations is developed and related to them. Accessibility and comprehension are emphasized in order to guide newcomers to the area. The book's second part contains a detailed survey of important methods in this field, such as VDM, and the methods due to Abadi & Lamport, Hehner, Lynch and Reynolds, Back's refinement calculus and Z. All these methods are carefully analysed, and shown to be either imcomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analyzed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation.

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to more complex systems, resulting from the object-oriented and the more recent component-based software engineering paradigms, requires further development of specification and verification techniques supporting the concepts of reusability and modifiability.

This book presents revised tutorial lectures given by invited speakers at the Second International Symposium on Formal Methods for Components and Objects, FMCO 2003, held in Leiden, The Netherlands, in November 2003. The 17 revised lectures by leading researchers present a comprehensive account of the potential of formal methods applied to large and complex software systems such as component-based systems and object systems. The book makes a unique contribution to bridging the gap between theory and practice in software engineering.

Largeandcomplexsoftwaresystemsprovidethenecessaryinfrastuctureinall- dustries today. In order to construct such large systems in a systematic manner, the focus in the development methodologies has switched in the last two decades from functional issues to structural issues: both data and functions are enc- sulated into software units that are integrated into large systems by means of various techniques supporting reusability and modi?ability. This encapsulation principleisessentialtoboththeobject-orientedandthemorerecentcompone- based sofware engineering paradigms. Formalmethodshavebeenappliedsuccessfullytotheveri?cationofmedi- sized programs in protocol and hardware design. However, their application to large systems requires the further development of speci?cation and veri?cation techniques supporting the concepts of reusability and modi?ability. In order to bring together researchers and practioners in the areas of so- ware engineering and formal methods, we organized the 1st International S- posium on Formal Methods for Components and Objects (FMCO) in Leiden, The Netherlands, November 5 8, 2002. The program consisted of invited tu- rials and more technical presentations given by leading experts in the ?elds of Theoretical Computer Science and Software Engineering. The symposium was attended by more than 100 people. This volume contains the contributions of the invited speakers to FMCO 2002. We believe that the presented material provides a unique combination of ideas on software engineering and formal methods which we hope will be an inspiration for those aiming at further bridging the gap between the theory and practice of software engineering."

This book originates from the International Symposium on Compositionality, COMPOS'97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.

This book constitutes the Proceedings of the IFIP Working Conference PRO COMET'98, held 8-12 June 1998 at Shelter Island, N.Y. The conference is organized by the t'wo IFIP TC 2 Working Groups 2.2 Formal Description of Programming Concepts and 2.3 Programming Methodology. WG2.2 and WG2.3 have been organizing these conferences every four years for over twenty years. The aim of such Working Conferences organized by IFIP Working Groups is to bring together leading scientists in a given area of computer science. Participation is by invitation only. As a result, these conferences distinguish themselves from other meetings by extensive and competent technical discus sions. PROCOMET stands for Programming Concepts and Methods, indicating that the area of discussion for the conference is the formal description of pro gramming concepts and methods, their tool support, and their applications. At PROCOMET working conferences, papers are presented from this whole area, reflecting the interest of the individuals in WG2.2 and WG2.3."

This volume presents the proceedings of the Third International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems held jointly with the Working Group Provably Correct Systems (ProCoS) at L beck, Germany in September 1994.
The book contains full versions of 5 invited talks and 33 carefully selected refereed contributions as well as 12 tool demonstrations. It documents that formal techniques constitute the foundation of a systematic design of real-time, fault-tolerant, and hybrid systems, throughout the whole engineering process, from the capture of requirements through specification, design, coding and compilation, right down to the hardware that embeds the system into its environment.

The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.

This volume is based on the "School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" organized by the editors and held in the period May 30-June 3, 1988 at Noordwijkerhout, The Netherlands. The School/Workshop was an activity of the project REX - Research and Education in Concurrent Systems. The volume contains tutorials and research contributions to the three approaches - linear time, - branching time, and - partial order in semantics and proof theory of concurrent programs by the main specialists in this field. It promotes an in-depth understanding of the relative merits and disadvantages of these three approaches. An introduction to the recent literature on the subject is provided by the invited research contributions.

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more emphasis on specification, modelling and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programming languages like Java.

The 6th International Symposium on Formal Methods for Components and Objects, FMCO 2007, was held in Amsterdam, The Netherlands, in October 2007. This book presents 12 revised papers submitted after the symposium by the speakers of each of the following European IST projects: the IST-FP6 project Mobius, developing the technology for establishing trust and security for the next generation of global computers; the IST-FP6 project SelfMan on self management for large-scale distributed systems based on structured overlay networks and components; the IST-FP6 project GridComp and the FP6 CoreGRID Network of Excellence on grid programming with components; the Real-time component cluster of the Network of Excellence on Embedded System Design ARTIST, focussing on design processes, and architectures for real-time embedded systems; and the IST-FP6 project CREDO on modeling and analysis of evolutionary structures for distributed services.

This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. The book is self-contained, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.