Skip to main content
Springer Nature Link
Log in

Program Construction

International Summer School

  • Book
  • © 1979

Overview

Editors:
  1. Friedrich L. Bauer
  2. Manfred Broy
  3. E. W. Dijkstra
  4. S. L. Gerhart
  5. D. Gries
  6. M. Griffiths
  7. J. V. Guttag
  8. J. J. Horning
  9. S. S. Owicki
  10. C. Pair
  11. H. Partsch
  12. P. Pepper
  13. M. Wirsing
  14. H. Wössner

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 69)

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

Access this book

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

Tax calculation will be finalised at checkout

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyboxMaxSingleColumnWidth = 480 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(initCollapsibles) function initCollapsibles(buyingOption, index) { var toggle = buyingOption.querySelector(".buying-option-price") buyingOption.classList.remove("expanded") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth -1 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (allOptionsInitiallyCollapsed || narrowBuyboxArea && index > 0) { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } else { toggle.click() } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (36 chapters)

  1. Front Matter

    Pages I-VII
    Download chapter PDF

  2. A more formal treatment of a less simple example

    • Edsger W. Dijkstra
    Pages 1-20

  3. Stationary behaviour of some ternary networks

    • Edsger W. Dijkstra
    Pages 21-23

  4. Finding the correctness proof of a concurrent program

    • Edsger W. Dijkstra
    Pages 24-34

  5. On the interplay between mathematics and programming

    • E. W. Dijkstra
    Pages 35-46

  6. A theorem about odd powers of odd integers

    • Edsger W. Dijkstra
    Pages 47-48

  7. In honour of Fibonacci

    • Edsger W. Dijkstra
    Pages 49-50

  8. On the foolishness of “natural language programming”

    • Edsger W. Dijkstra
    Pages 51-53

  9. Program inversion

    • Edsger W. Dijkstra
    Pages 54-57

  10. The Schorr-Waite graph marking algorithm

    • David Gries
    Pages 58-69

  11. Eliminating the chaff

    • David Gries
    Pages 70-74

  12. Proofs, programs and their development — The axiomatic approach

    • D. Gries
    Pages 75-76

  13. Current ideas in programming methodology

    • David Gries
    Pages 77-93

  14. Basic axiomatic definitions

    • David Gries
    Pages 94-99

  15. The multiple assignment statement

    • David Gries
    Pages 100-112

  16. Is sometimes ever better than always?

    • David Gries
    Pages 113-124

  17. A case study in language design: Euclid

    • J. J. Horning
    Pages 125-132

  18. Proof rules for the programming language Euclid

    • R. L. London, J. V. Guttag, J. J. Horning, B. W. Lampson, J. G. Mitchell, G. J. Popek
    Pages 133-163

  19. Verification of Euclid programs

    • J. J. Horning
    Pages 164-173

  20. Specifications and proofs for abstract data types in concurrent programs

    • Susan S. Owicki
    Pages 174-197
Back to top

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

  • Book Title: Program Construction

  • Book Subtitle: International Summer School

  • Editors: Friedrich L. Bauer, Manfred Broy, E. W. Dijkstra, S. L. Gerhart, D. Gries, M. Griffiths, J. V. Guttag, J. J. Horning, S. S. Owicki, C. Pair, H. Partsch, P. Pepper, M. Wirsing, … H. Wössner

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0014649

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1979

  • Softcover ISBN: 978-3-540-09251-3Published: 01 June 1979

  • eBook ISBN: 978-3-540-35312-6Published: 23 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 654

  • Topics: Programming Techniques

Publish with us

Policies and ethics

Back to top