A Discipline of Programming
| Authors | Dijkstra, Edsger W. |
| Tags | COMPUTERS, Information theory, Reference, Questions & Answers |
| Publisher | Prentice-Hall |
| Published | 15 feb 1976 |
| Date | 24 feb 2016 |
| Languages | eng |
| Identifiers | google: nZpQAAAAMAAJ, oclc: 565662199, Amazon.com, isbn: 013215871X |
| Formats | DJVU |
Description
Executional abstraction; The role of programming languages; States and their characterization; The characterization of semantics; The semantic characterization of a programming language; Two theorems; On the design of properly terminating; Euclid's algorithm revisited; The formal treatment of some small examples; The linear search theorem; The problem of the next permutation.
Dijkstra wrote (p. 20, DjVu p. 35):
As I have now said many times and written in many places: program testing can be quite effective for showing the presence of bugs, but is hopelessly inadequate for showing their absence.