Stepwise Refinement of Distributed Systems | Models, Formalisms, Correctness. REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989. Proceedings

Jaco W. De Bakker (u. a.)

ISBN 10: 3540525599 / ISBN 13: 9783540525592

Published by Springer, 1990

About this Item

Stepwise Refinement of Distributed Systems | Models, Formalisms, Correctness. REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989. Proceedings | Jaco W. De Bakker (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 1990 | Springer | EAN 9783540525592 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.

Seller Inventory # 102140593

Bibliographic Details

• Title: Stepwise Refinement of Distributed Systems | Models, Formalisms, Correctness. REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989. Proceedings
• Publisher: Springer
• Publication Date: 1990
• Language: English
• ISBN 10: 3540525599
• ISBN 13: 9783540525592
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 44D millimeters 235 millimeters width by 155 millimeters height by 44 millimeters depth
• Weight: 1223 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.