Skip to main content
SpringerLink
Log in

Programming and Mathematical Method

International Summer School

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Manfred Broy

    1. Institut für Informatik, Technische Universität München, München 2, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 88)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Examples of Derivations

    1. Front Matter

      Pages 1-2
      Download chapter PDF

    2. On the design of a simple proof for Morley’s Theorem

      • Edsger W. Dijkstra
      Pages 3-9

    3. Well-foundedness and the transitive closure

      • A. J. M. van Gasteren, Edsger W. Dijkstra
      Pages 11-15

    4. Designing the proof of Vizing’s Theorem

      • Josyula R. Rao, Edsger W. Dijkstra
      Pages 17-25

    5. Phase Synchronization for two machines

      • Wim H. J. Feijen
      Pages 27-31

    6. The Lexicographic Minimum of a Cyclic Array

      • Wim H. J. Feijen
      Pages 33-42

  3. Rules of Programming

    1. Front Matter

      Pages 43-44
      Download chapter PDF

    2. Metalevel Programming in Constructive Type Theory

      • Robert L. Constable
      Pages 45-93

    3. Laws of Programming

      • C. A. R. Hoare, I. J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders et al.
      Pages 95-122

    4. Some Applications of Pointer Algebra

      • Bernhard Möller
      Pages 123-155

    5. Some generalizations and applications of Dijkstra’s guarded commands

      • Greg Nelson
      Pages 157-191

  4. Refinement and Program Composition

    1. Front Matter

      Pages 193-194
      Download chapter PDF

    2. A Theory of Program Composition

      • K. Mani Chandy
      Pages 195-212

    3. Lectures on Data Refinement

      • David Gries
      Pages 213-244

    4. Refinement algebra proves correctness of compilation

      • C. A. R. Hoare, He Jifeng
      Pages 245-269

  5. Distributed Systems

    1. Front Matter

      Pages 271-272
      Download chapter PDF

    2. Process Algebra with Signals and Conditions

      • J. C. M. Baeten, J. A. Bergstra
      Pages 273-323

    3. Functional Specification of Time Sensitive Communicating Systems

      • Manfred Broy
      Pages 325-367

    4. Systematic Derivation of Communicating Programs

      • Ernst-Rüdiger Olderog
      Pages 369-407
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Institut für Informatik, Technische Universität München, München 2, Germany

    Manfred Broy

Bibliographic Information

  • Book Title: Programming and Mathematical Method

  • Book Subtitle: International Summer School

  • Editors: Manfred Broy

  • Series Title: NATO ASI Subseries F:

  • DOI: https://doi.org/10.1007/978-3-642-77572-7

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1992

  • Softcover ISBN: 978-3-642-77574-1Published: 21 December 2011

  • eBook ISBN: 978-3-642-77572-7Published: 06 December 2012

  • Series ISSN: 0258-1248

  • Edition Number: 1

  • Number of Pages: VIII, 407

  • Topics: Programming Techniques, Software Engineering, Logics and Meanings of Programs

Publish with us

Policies and ethics

Back to top

Search

Navigation