stepwise refinement distributed systems von bakker roever (5 Ergebnisse)

Paperback. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. Lecture Notes in Computer Science 430; Ex-Library. Fractional bump to front spine side. Previous owner's sticker on the front cover. Ink stamp and small pen inscription on title page; library catalogue sticker on colophon. Minute traces of sticker residue to spine face. Faintly bumped spine head and leading corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Broschiert. Zustand: Gut. 808 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1220.

Taschenbuch. Zustand: Gut. 808 Seiten Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand Sprache: Englisch Gewicht in Gramm: 550.

Taschenbuch. Zustand: Neu. 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-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.