Differences

This shows you the differences between two versions of the page.

--- course_outline [2013/02/26 03:32] – jonathan
+++ course_outline [2013/04/07 15:52] (current) – jonathan
@@ Line 40: / Line 40: @@
 ===== Sequential Program Development =====
-[[http://deploy-eprints.ecs.soton.ac.uk/122/1/sld.ch15%2Cseq.pdf|Sequential Programs]]. This is Chapter 15 in the text (which is required reading).
+[[http://deploy-eprints.ecs.soton.ac.uk/122/1/sld.ch15%2Cseq.pdf|Sequential Programs]]. This is Chapter 15 in the text (which is required reading). This includes the merging rules.
+We study two examples of the development of programs using loops by Dijkstra using the Hoare notation and the proof obligations for loop invariants and variants. Separation of concerns via partial correctness and termination arguments. Weakest preconditions and the wp-axiom for assignment. See also the slides "LoopsAndDisjkstra". This topic is dicussed in detail in Science of Programming (David Gries, chapter 11).
+===== Using Relations =====
+We develop a phone book example by developing a mathematical model from informal E/R-descriptions. We discuss the importance and significance of the relation (and function) override operator. See slides "UsingRelations" in the SVN which includes: relations, relational image, relational inverse, domain and range restrictions and subtractions, and relational composition.
+===== More systems =====
+in the last two weeks of class we studied a train system and an EHealth medication system.
+For the EHealth system the requirements were:
+  *E1: a set of doctors prescribes drugs to a set of patients
+  *E2: there exists pairs of drugs that when taken together have undesirable interactions
+  *E3: Drug interaction is symmetric, i.e. if a drug interacts with another, then the reverse also applies
+  *R1: A doctor shall be capable of adding drugs to a patients’ prescription.
+  *R2: A doctor shall not prescribe two drugs that interact
+  *Goal:  minimize the number of undesirable interactions