Dijkstra, Hoare and Parnas

Chapter
Part of the Undergraduate Topics in Computer Science book series (UTICS)

Abstract

This Chapter focuses on the approach of Dijkstra, Hoare and Parnas. We discuss the calculus of weakest preconditions developed by Dijkstra and the axiomatic semantics of programming languages developed by Hoare. We then discuss the classical engineering approach of Parnas and his tabular expressions.

Reference

  1. 1.
    G. O’ Regan, Mathematical Approaches to Software Quality, vol 26 (Springer, London)Google Scholar
  2. 2.
    C. Jones, Systematic Software Development using VDM (Prentice Hall International, 1986)Google Scholar
  3. 3.
    E.W. Dijkstra, A Disciple of Programming (Prentice Hall, Englewood Cliffs, NJ, 1976)Google Scholar
  4. 4.
    D. Gries, The Science of Programming (Springer, Berlin, 1981)Google Scholar
  5. 5.
    R. Floyd, Assigning Meanings to Programs, in Proc. Symp. Appl. Math. (19), 19–32 (1967)Google Scholar
  6. 6.
    C.A.R. Hoare, An axiomatic basis for computer programming. Commun. ACM 12(10), 576–585 (1969)Google Scholar
  7. 7.
    D. Hoffman, D.L. Parnas, in Software Fundamentals, ed. by D. Weiss. Collected Papers by D.L. Parnas (Addison Wesley, Reading, 21)Google Scholar
  8. 8.
    R. Janicki, On a Formal Semantics of Tabular Expressions. Technical Report CRL 355. Communications Research Laboratory, McMaster University, Ontario (1997)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.SQC ConsultingMallow, County CorkIreland

Personalised recommendations