Editing Program derivation (section)

==References==
*  [[Edsger W. Dijkstra]], Wim H. J. Feijen, ''A Method of Programming'', Addison-Wesley, 1988, 188 pages
* Edward Cohen, ''Programming in the 1990s'', Springer-Verlag, 1990
* Anne Kaldewaij, ''Programming: The Derivation of Algorithms'', Prentice-Hall, 1990, 216 pages
*  David Gries, ''The Science of Programming'', Springer-Verlag, 1981, 350 pages
* [[Carroll Morgan (computer scientist)]], [http://www.cs.ox.ac.uk/publications/books/PfS/ ''Programming from Specifications''],  International Series in Computer Science (2nd ed.), Prentice-Hall, 1998.
* [[Eric Hehner|Eric C.R. Hehner]], [http://www.cs.toronto.edu/~hehner/aPToP/ ''a Practical Theory of Programming''], 2008, 235 pages
* A.J.M. van Gasteren. ''On the Shape of Mathematical Arguments''. Lecture Notes in Computer Science #445, Springer-Verlag, 1990. Teaches how to write proofs with clarity and precision.
* Martin Rem. "Small Programming Exercises", appeared in ''Science of Computer Programming'', Vol.3 (1983) through Vol.14 (1990).
* Roland Backhouse. ''Program Construction: Calculating Implementations from Specifications''. Wiley, 2003.  {{ISBN|978-0-470-84882-1}}.
* Derrick G. Kourie, Bruce W. Watson. ''The Correctness-by-Construction Approach to Programming''. Springer-Verlag, 2012. {{ISBN|978-3-642-27919-5}}. Provides a step-by-step explanation of how to derive mathematically correct algorithms using small and tractable refinements.

[[Category:Program derivation| ]]