Learning Modules

Number	Title	Slides	Lectures
0	Introduction to this Unit	0	01
1	Introduction to Event-B	51	01,02
1a	Abrial's Introduction to Event-B	34	03,04
2	Case Study: The Bridge	19	05,06
3	Mathematical Background	54	07,08
3a	Formal Definitions	63	-
4	Abstract Machines	63	-
5	The Library Case Study	20	09,10
6	Refinement - The Square Root Machine	28	12
7	Substitutions	199	-
8	Semantics of Event-B	86	11
9	Abrial's Proof Obligations Slides	61	14
10	Refinement	238	20,22,23
11	Sorting Algorithms	81	14,15,16
12	Abrial's File Transmission Protocol Slides	61	18,19
	Total Slides/Average per Lecture	1058	29.39

Document History

20100224:135759

9.0.0

ajh

first draft for 2010

This page maintained by John Hurst.
Copyright Monash University Copyright Policy

11 accesses since
24 Feb 2010

Generated at 20100314:0251 from an XML file modified on 20100224:1400
Maintainer use only; not generally accessible: Local Server Work Server CSSE Server

125 accesses since 01 Mar 2010, HTML cache rendered at 20120524:0834