Formal Software Development
Spring Semester 2008
| Week | Files for viewing/download | Additional Handout | Comment | |
|---|---|---|---|---|
| 1 |
Lecture 1
|
Introduction and AMN constructs | ||
| 2 |
Walkthrough lecture 2
Supporting slides
Lecture 2
| Relations and Functions | ||
| 3 (stable 28/01/08 ) |
Lecture 3
|
wk3strengtheningpreforcard.mch
| Arrays and Introduction to Verification | |
| 4 (stable 13/02/07) |
Lecture 4
We also started to look at structuring machines Case study based on structuring in a B machine |
These machines are referred to in the slides
PaperRound.mch
These machines were used when discussing structuring: FemaleTracker_wk4eg.mch |
B machines to experiment with in a proof and slides on verifying parameterised machines as shown in PaperRound machine
|
|
| 5 (stable 14/02/07) |
Lecture 5
|
Machines used in class to illustrate include proof obligations.
|
Structuring (SEES,INCLUDES) and Proof obligations related to structuring. | |
| 6 |
Walkthrough lecture 3
Supporting slides wk6
Lecture 6 (Wednesday) |
These machines are used in the walkthrough
MaxOfSet.mch The following files are available for more examples of refinement used in the lecture in week 6 Milk Round Development |
Introduction to Refinement. Sample Solution from lecture -
TeamR2.ref
| |
| 7 |
Walkthrough of an implementation
Introduction to loops via an example
|
Walkthrough sources
FragileStack.mch Walkthrough solutions StackI.imp
| Implementations/Interfaces and Code Generation | |
| 8 | There were no lectures in week 8 - cancelled due to illness. However, we did turn it into a lab where we looked at the word tracker example. See under the lab section. | None | The focus of this week was on loops in the lab | |
| 9 | This week we will be looking to formalise the proof obligations for loops. | None | None | |
| 10 | This week we will be finishing the course by looking at how to review B specifications. We will also finish up with more examples of structuring in order to achieve this. | None | None |
