Differences

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

--- start [2009/01/21 04:04] – jonathan
+++ start [2009/03/11 17:24] (current) – jonathan
@@ Line 2: / Line 2: @@
 ====== F09-GS/CSE6411: Programming Logic for Complex Systems  ======
-Programming Logic for Complex Systems This course covers program verification methods for a class of programs, commonly referred to as reactive programs. Reactive programs typically never terminate and are run in order to maintain some interaction with the environment. An adequate description of reactive systems must refer not only to initial and final states, but also to the ongoing behaviour as a (possibly infinite) sequence of states and events. The purpose of this course is to investigate the use of logical calculi for the **specification**, **design** and **verification** of reactive systems. Topics include: modelling of discrete event systems, semantics of real-time languages, logical and discrete calculi (e.g. temporal logic) for specifying and verifying safety, liveness, deadlock, priority and fairness properties of reactive programs, and prolog tools for automating verification
+  * Please **login** to the wiki (see bottom** ↓** of this page for login).
+  * Slides from the first lecture and for the second are available in the SVN repository.
+  * Please try out the Rodin Event-B Eclipse tool in preparation for Monday's class.
+  * [[public:course|Course Contents]].
-We will be using industrial strength methods and tools such as B, Alloy and Spin.
 ===== Lecture Times =====
-Winter 2009:
+Winter 2009: Starting Wednesday March 4th, 2009
+Mondays and Wednesdays: 11:30am-1pm
+Location: SEL (Software Engineering Laboratory, CSEB2056)
-Mondays and Wednesdays: 11:30am-1pm R N836
+Office hours: directly after class.