pop up description layer
Last modified: 20080624:222606/first version for 2008

FIT3013 AJH-2009-10

Teaching and Learning Methods Page

Philosophy | Feedback | Learning Modules | Lecture Timetable | Lectures | Tutorial Timetable | Laboratories | Learning Resources

Philosophy

I enjoy teaching. And I want students to enjoy learning!

So how to go about this? I think it has to be a joint effort between staff and students. A year os so ago, the faculty invited some students to comment upon what they thought contributed to their learning, and by implication, their enjoyment of learning. Here's a few of the comments that I noted down:

I hope we can explore a few of these ideas this semester.

Feedback

Part of the process of learning requires the teacher to adjust the material to suit the pace of the student. Doing this requires feedback from the student to the teacher. Here are some possibilities for feedback in this unit:

Wait for the end of semester, and complete the unit evaluation
Not very useful for students during the semester!
A minute paper written by students and handed in at the end of a class (a collection of dot points) about what they still need to understand on the topic can give pertinent feedback and prevent topic derailing for students (Faculty suggestion)
OK, but requires discipline on the part of each student!
Wiki (Moodle) page that records the same ideas
Good, because everyone can see what the issues are, and add to them, or otherwise comment.

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

Lecture Timetable

In this table, green entries have been released to students, black entries are in draft form or not yet available, while red entries indicate activities that have been completed.

Week Date Lecture Tute Lab Objs Content Notes PDFs
1 02 Mar 01     1,2,4 Introduction to this Unit, Introduction to Event B 1-2 1-27
1 04 Mar 02     1,2,4 Introduction to Event B 2-4 28-50
2 9 Mar 03     1 Abrial's Introduction to Event-B NA 1-27
2 11 Mar 04     Abrial's Introduction to Event-B, Revision of Set Theory NA, 1-3 27-34, 1-58
3 16 Mar 05     1,2,3,12,13 The Bridge Problem 1-9 NA
3 18 Mar 06     1,2,3,12,13 The Bridge Problem , Use of Rodin 9-16 NA
4 23 Mar 07     1 Abrial's Mathematical Background NA 1-60
4 25 Mar 08     1 Abrial's Mathematical Background NA 60-134
5 30 Mar 09     Simple Library Machine 1-79
5 01 Apr 10     Simple Library Machine 80-151
6 06 Apr 11     Semantics and Proof Obligations in Event-B 1-8 1-86
6 08 Apr 12     7,10,12,13 The Square Root Machine 1-12 1-78
13 Apr -     Mid-semester (!) break - no lectures this week
15 Apr -     Mid-semester (!) break - no lectures this week
7 20 Apr 13     Abrial Proof Obligations 1-29
7 22 Apr 14     Abrial Proof Obligations , Sorting Algorithms 30-61, 1-10
8 27 Apr 15     Sorting Algorithms (as presented) 10-62
8 29 Apr 16     Sorting Algorithm Example , Sorting Algorithms (revised) 1-49, 1-81
9 04 May 17     Preconditions and Guards 1-11 1-61
9 06 May 18     The File Transmission Protocol 1-61
10 11 May 19     The File Transmission Protocol 62-121
10 13 May 20     Refinement Revisited 1-73
11 18 May 21     CANCELLED
11 20 May 22     Refinement Revisited 74-116
12 25 May 23     Refinement Revisited 117-237
12 27 May 24     CANCELLED
13 01 Jun 25     revision
13 03 Jun 26     Review of various exam papers

Lectures

The lectures will be held at 12noon in H3 on Mondays and 12noon in R6 on Wednesdays.

The lectures are based upon a set of slides kindly supplied by A/Prof Ken Robinson, of the University of New South Wales and available on-line. The text book, The B-Method, by Steve Schneider, is also used to support the lecture content, although be aware that the book describes a slightly earlier notation, the B Method. In this unit, we will be dealing with the Event-B notation.

Each learning module has an index page (accessed by clicking the name of the learning module entries in the on-line table) which gives links not only to the slides used in this learning module, but also related learning materials. Links under "Slides" are to the slides used in lectures, while links under "Notes" are to a form more suitable for printing.

Important Note: The index pages also contain links to other supporting material that will also be used in lectures. Do not make the mistake of thinking that the lecture notes define the examinable material for the unit! Examinable material is all that material covered in lectures and in documents referenced in these pages (such as tutorials and assignments, including the discussions), unless otherwise specified.

A good way of deciding whether learning materials made available in this unit are examinable is to check them against the unit objectives. If they relate to the unit objectives, they are examinable!

Please bear in mind that at the time of writing, not all materials to be used in the lectures have been identified. This page will be updated regularly to reflect past practice, current happenings, and future intentions. Lines in red represent completed activities.

Tutorial Timetable

Week Date Tute Objs Content Solutions PDFs
2 9 Mar 01 Set Theory Revision (Q1-Q3) Q1-Q3 pdf version
3 16 Mar 02 1 Set Theory Revision (Q4) Q1-Q4 pdf version
4 23 Mar 03 Set Theory Revision (Q5-Q6) Q1-Q6 pdf version
5 30 Mar 04 Simple Library Machine Development Q1-Q2 pdf version
6 06 Apr 05 Simple Event-B Machines: Bank Simple Bank pdf version
7 20 Apr 06 Simple Event-B Machines: Traffic Lights Traffic Lights pdf version
8 27 Apr 07 Simple Event-B Machines: Lift Machine (solution included) pdf version
9 04 May 09 The Bag Machine (solution included) pdf version
10 11 May 10 More Refinement Examples Q1 , Q1R , Q2 , Q2R pdf version
11 18 May 11 CANCELLED
12 25 May 12 Refinement (Traffic Lights again) pdf version
13 01 Jun 13 Review of 2008 Exam Paper

Laboratories

There are no formally allocated laboratories for this unit, but students are expected to avail themselves of laboratory resources in learning specification skills with the use of the Rodin tool. This tool is also available for downloading (see the Resources Page), and running on personal computers or laptops.

Use of the Rodin tool is required to complete the assignments.

Learning Resources


Document History

20080624:222606 7.0.0 ajh first version for 2008

This page maintained by John Hurst.
Copyright Monash University Copyright Policy
70 accesses since
25 Mar 2009
My PhotoTrain Photo

Generated at 20090725:0650 from an XML file modified on 20090325:1129
Maintainer use only; not generally accessible: Local Server Work Server CSSE Server

114 accesses since 25 Mar 2009, HTML cache rendered at 20091122:0934