Programming and Mathematical Method

International Summer School

  • Manfred Broy

Part of the NATO ASI Series book series (volume 88)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Examples of Derivations

    1. Front Matter
      Pages 1-2
    2. A. J. M. van Gasteren, Edsger W. Dijkstra
      Pages 11-15
    3. Josyula R. Rao, Edsger W. Dijkstra
      Pages 17-25
    4. Wim H. J. Feijen
      Pages 27-31
    5. Wim H. J. Feijen
      Pages 33-42
  3. Rules of Programming

    1. Front Matter
      Pages 43-44
    2. Robert L. Constable
      Pages 45-93
    3. C. A. R. Hoare, I. J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders et al.
      Pages 95-122
    4. Bernhard Möller
      Pages 123-155
  4. Refinement and Program Composition

    1. Front Matter
      Pages 193-194
    2. K. Mani Chandy
      Pages 195-212
    3. David Gries
      Pages 213-244
    4. C. A. R. Hoare, He Jifeng
      Pages 245-269
  5. Distributed Systems

    1. Front Matter
      Pages 271-272
    2. J. C. M. Baeten, J. A. Bergstra
      Pages 273-323
    3. Ernst-Rüdiger Olderog
      Pages 369-407

About these proceedings

Introduction

The Summer School in Marktoberdorf 1990 had as its overall theme the development of programs as an activity that can be carried out based on and supported by a mathematical method. In particular mathematical methods for the development of programs as parts of distributed systems were included. Mathematical programming methods are a very important topic for which a lot of research in recent years has been carried out. In the Marktoberdorf Summer School outstanding scientists lectured on mathematical programming methods. The lectures centred around logical and functional calculi for the • specification, • refinement, • verification of programs and program systems. Some extremely remarkable examples were given. Looking at these examples it becomes clear that proper research and teaching in the area of program methodology should always show its value by being applied at least to small examples or case studies. It is one of the problems of computing science that examples and case studies have to be short and small to be lJresentable in lectures and papers of moderate size. However, even small examples can tell a lot about the tractability and adequacy of methods and being able to treat small examples does at least prove that the method can be applied in modest ways. Furthermore it demonstrates to some extent the notational and calculational overhead of applying formal methods.

Keywords

Programmierung Programmverifikation Verteilte Systeme algorithms design development distributed systems functional programming logic process algebra program verification programming software software engineering verification

Editors and affiliations

  • Manfred Broy
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2Germany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-77572-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-77574-1
  • Online ISBN 978-3-642-77572-7
  • About this book