Differences

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

--- course_outline [2015/04/07 23:51] – jonathan
+++ course_outline [2018/01/03 02:03] (current) – jonathan
@@ Line 2: / Line 2: @@
 The course outline is a guideline to topics that will be discussed in the course, and when they will be discussed:
+===== Introduction =====
+Use this small project to get started with Event-B and the Rodin tool
+  * {{:01-intro-bank.pdf|Simple Bank System}}. Introduction to Specification and Refinement.
+  * [[https://youtu.be/aROKK2HKhog|Video Presentation]]
 ===== Reactive systems: Bridge =====
@@ Line 56: / Line 65: @@
 ===== TLA+ Thinking for Programmers =====
+[[http://lamport.azurewebsites.net/video/videos.html|TLA Videos]]
 See slides 11: Thinking for Programmers. Leslie Lamport's TLA+ specification tool, its use at Amazon and for MS/Xbox 360. Thinking for programmers. QuickSort at the algorithmic level as a divide and conquer algorithm rather than a program. The algorithm can be refined to a recursive implementation, an iterative implementation and a concurrent implementation.
@@ Line 69: / Line 80: @@
 ===== Exam Preparation =====
-Develop a phone book example by developing a mathematical model from informal E/R-descriptions. Relations, Functions and the override operator, relational image, relational inverse, domain and range restrictions and subtractions, and relational composition. See slides 13.
+The following examples are unlikely to be on the exam.
+Develop a phone book example by developing a mathematical model from informal E/R-descriptions. Relations, Functions and the override operator, relational image, relational inverse, domain and range restrictions and subtractions, and relational composition.