Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness. REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989. Proceedings: 430 (Lecture Notes in Computer Science) - Tapa blanda

 
9783540525592: Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness. REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989. Proceedings: 430 (Lecture Notes in Computer Science)
Tapa blanda
ISBN 10: 3540525599 ISBN 13: 9783540525592
Editorial: Springer, 1990

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1990
Idioma
Inglés
ISBN 10 
3540525599
ISBN 13 
9783540525592
Encuadernación
Tapa blanda
Número de páginas
824
Editor
De Bakker J. W.
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania