Skip to main content

On Progress in Programming

  • Chapter
Informatik und Mathematik
  • 137 Accesses

Abstract

The past twenty years have seen an enormous increase in the influence of proof-of-correctness ideas on our ability to write and present programs and algorithms. It started with R. Floyd’s paper on assigning meanings to programs in 1967 [2] and C.A.R. Hoare’s paper on an axiomatic basis for programming in 1969 [4]. E.W. Dijkstra’s 1976 text [1] provided key ideas on the development of proof and program hand-in-hand, with the proof ideas leading the way. Since then, we have been developing and refining the ideas and practicing them more and more. The transformational development system developed under the direction of F.L. Bauer [0] exhibits further advances in the state of the art.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauer, F.L., et al. The Munich Project CEP. Vol. I: The wide spectrum language CIP-L and Vol H: The Transformation System CIP-S. Springer Verlag LNCS 183 (1985) and 292 (1987).

    Google Scholar 

  2. Dijkstra, E.W. A Discipline of Programming. Prentice Hall, New Jersey, 1976.

    MATH  Google Scholar 

  3. Floyd, R. Assigning meanings to programs. Proc. Amer. Math. Soc. Symp. in Applied Mathematics 19 (1967), 139–143.

    Google Scholar 

  4. Gries, D., and J. van de Snepscheut. Iterative inorder traversal of a binary tree and its inversion. TR87–876, Computer Science Department, Cornell University, November 1987.

    Google Scholar 

  5. Hoare, C.A.R. An axiomatic basis for computer programming. CACM 12 (Oct 1969), 576580, 583.

    Google Scholar 

  6. Dijkstra, E.W. ed. Formal Development of Programs and Proofs. Addison-Wesley, 1990. (Proc. Year of Programming Institute, Austin, Texas, October 1987.)

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gries, D. (1991). On Progress in Programming. In: Broy, M. (eds) Informatik und Mathematik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76677-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76677-0_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-76678-7

  • Online ISBN: 978-3-642-76677-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics