Program Dynamics Course

I am offering a course with the title "Program Dynamics" at the International Institute of Information Technology, Hyderabad, India, for the second time around. The course is based on the book IMCS with some additional topics. On occasion, it becomes necessary to present details to students that are omitted in the book. Again, on occasion, I think that perhaps a more elementary way of presenting a topic than in the book is possible. All such additional material, if it finds its way to being written up neatly, appears below.
HoareRulesinMapcode.pdf
View Download		 We present the axioms of Hoare as theorems in mapcode and prove them correct. This shows that any argument that proves a program correct using Hoare's axioms may be expressed in mapcode.  75k v. 2 Sep 4, 2009 10:52 PM Viswanath Kasturi
Knuth'sEffectiveAlgorithms.pdf
View Download		 An elaboration of the definition of effective algorithms as presented by Knuth in the first volume of his book, rewritten in the mapcode format.  83k v. 2 Sep 1, 2009 6:52 AM Viswanath Kasturi
NondeterministicMapcode.pdf
View Download		 We show how the wp-formalism of Dijkstra may be derived from a nondeterministic version of mapcode. This makes Dijkstra's approach to computer science easier to understand and to teach.   87k v. 2 Sep 8, 2009 12:27 AM Viswanath Kasturi
The10-StepDesignProcess.pdf
View Download		 The 10-Point Design Process is the way mapcode programs are created. We give a simple presentation here.  99k v. 1 Aug 24, 2009 8:40 AM Viswanath Kasturi
TheDijkstra-GriesMethodology.pdf
View Download		 A simple exposition of the Dijkstra-Gries Methodology of deriving algorithms to meet specifications in such a way that one simultaneously ensures their termination and correctness.   55k v. 2 Aug 24, 2009 8:35 AM Viswanath Kasturi