ENGLISH

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

By Martín Abadi , G. Rozenberg (eds.) , Leslie Lamport (auth.) , J. W. de Bakker , W. -P. de Roever

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1990
ISBN
3540525599, 9783540525592
DOI
10.1007/3-540-52559-9
LCC
QA76.9.D5 S75 1990
Open Library ID
OL1857504M
Language
english
Format
DJVU
Filesize
8 MB (7885344 bytes)
Series
Lecture Notes in Computer Science 430
Edition
1
Pages
812\817
Library
Kolxo3
DPI
300
Time added
2011-01-06 10:13:16
Logics and Meanings of Programs; Programming Techn

Description

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.

Similar books