Differences

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

--- start [2016/01/06 16:47] – jonathan
+++ start [2016/04/19 22:22] (current) – jonathan
@@ Line 23: / Line 23: @@
   * Suggested Text: Jean-Raymond Abrial, //Modeling in Event-B: System and
-Software Engineering//, Cambridge 2010. Available in Steacie. See SVN for notes. [[https://wiki.eecs.yorku.ca/project/sel-students/p:tutorials:eventb:start|Event-B Information]]
+Software Engineering//, Cambridge 2010. Available in Steacie. See SVN for notes.
+  * See [[https://wiki.eecs.yorku.ca/project/sel-students/p:tutorials:eventb:start|Event-B Information]] for notes on Equational Logic and also on the Sequent Calculus used by Event-B/Rodin. There is an online tutorial on the sequent calculus with point and click to try proofs. Rodin works somewhat differently but the underlying concepts are similar.
 ===== Calendar Description  =====
@@ Line 53: / Line 55: @@
 The lab time is used to give students detailed exercises and instruction in using a practical verification tool (such as Rodin for Event-B) to accompany the material in the lectures. Tools are essential to using the theory and methods on larger examples and require expert knowledge of the use of automated theorem proving methods. Students will use such tools to prove the examples that are discussed in class as well as larger examples.
+==== Course Outline ====
+. High-level state/event models and proof rules for invariant preservation
+. Refining a system and proving that the refinement preserves correctness
+. Proving convergence and absence of deadlock
+. Overview of system modelling constructs and proof rules for correctness in a reactive system
+. Design of a distributed systems illustrated with an ftp protocol
+. Anticipated events in high-level models for convergence
+. Use of contexts to develop relevant theories such as parity
+. Nondeterministic systems and associated safety invariant proof rules
+. Design of sequential programs with correction by construction via refinement rules
+. Hoare logic and weakest preconditions for program design and its use in a variety of developments
+. Methods for systematic development of correct-by-construction of reactive systems, illustrated with a train system
+. Thinking before Programming using Lamport’s TLA+ specification method
+===== Grades =====
+  * [30%] Weekly quizzes. There will be about 8 weekly quizzes (almost every week). The first 2 quizzes each count 3%. The last 6 quizzes each count 4%. On condition that the Lab work is completed. Quizzes will be based on the Labs, lectures and required readings of the preceding weeks.
+  * [15%] LabTest after reading week.
+  * [15%] Project (working in a team of no more than two students)
+  * [40%] Final exam
+It is required that you attend and complete the work allocated in the weekly Lab session in preparation for the Quizzes, Labtest, Project and Exam. <hi> Labs must be completed by their due date in order for you to receive credit for the Quizzes</hi>