Advertisement

Table of contents

  1. Front Matter
  2. Martín Abadi, Leslie Lamport
    Pages 1-41
  3. Howard Barringer, Michael Fisher, Dov Gabbay, Graham Gough, Richard Owens
    Pages 94-129
  4. Werner Damm, Gert Döhmen, Volker Gerstner, Bernhard Josko
    Pages 180-207
  5. H. -D. Ehrich, A. Sernadas
    Pages 239-266
  6. Rob van Glabbeek, Ursula Goltz
    Pages 267-300
  7. He Jifeng
    Pages 340-360
  8. R. P. Kurshan
    Pages 414-453
  9. Simon S. Lam, A. Udaya Shankar
    Pages 454-486
  10. Nancy A. Lynch
    Pages 519-543
  11. Michael Merritt
    Pages 544-560
  12. Ernst-Rüdiger Olderog
    Pages 592-621
  13. A. Udaya Shankar, Simon S. Lam
    Pages 669-695
  14. Jeannette M. Wing
    Pages 731-758
  15. Back Matter

About these proceedings

Introduction

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.

Keywords

Ableitung Beweistheorie Verfeinerung automata distributed systems formal verification logic model checking petri net programming proof theory semantics verification verteiltes Datenverarbeitungssystem

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-52559-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 1990
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52559-2
  • Online ISBN 978-3-540-47035-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site