Compositionality: The Significant Difference: International Symposium, Compos'97 Bad Malente, Germany, September 8-12, 1997 Revised Lectures

ISBN-13: 9783540654933 / Angielski / Miękka / 1998 / 647 str.

Hans Langmaack; W. P. De Roever; A. Pnueli

Opis

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.

Spis treści

The Need for Compositional Proof Systems: A Survey.- Alternating-time Temporal Logic.- Compositionality in dataflow synchronous languages: specification & code generation.- Compositional Reasoning in Model Checking.- Modeling Urgency in Timed Systems.- Compositional Refinement of Interactive Systems Modelled by Relations.- Toward Parametric Verification of Open Distributed Systems.- A Compositional Real-time Semantics of STATEMATE Designs.- Deductive Verification of Modular Systems.- Compositional Verification of Real-Time Applications.- Compositional Proofs for Concurrent Objects.- An overview of compositional translations.- Compositional Verification of Multi-Agent Systems: a Formal Analysis of Pro-activeness and Reactiveness.- Modular Model Checking.- Composition: A Way to Make Proofs Harder.- Compositionality Criteria for Defining Mixed-Styles Synchronous Languages.- Compositional Reasoning using Interval Temporal Logic and Tempura.- Decomposing Real-Time Specifications.- On the Combination of Synchronous Languages.- Compositional Verification of Randomized Distributed Algorithms.- Lazy Compositional Verication.- Compositional Reasoning Using the Assumption-Commitment Paradigm.- An Adequate First Order Interval Logic.- Compositional Transformational Design for Concurrent Programs.- Compositional proof methods for concurrency: A semantic approach.