Subsections
The notes will be very sparse; I will only put in them definitions and
the like (and maybe some worked, tedious exercises). The main matter
will be discussed on the blackboard; these notes are just a mean to
save me (and you too) some writing (and so some time).
My lectures are recorded, as follows:
- The introduction (Lecture 1) was not captured.
- The language of CSP: Lecture
2,
Lecture
3
(no audio),
Lecture
4
(partial audio),
Lecture
5, Lecture 6
(recording unavailable)
- Trace semantics: Lecture 7 (recording unavailable),
Lecture
8,
Lecture
9, first half of
Lecture
10
- Trace specification and verification: Second half of
Lecture
10,
Lecture
11,
Lecture
12,
Lecture
13, first part of
Lecture
14
- Stable failures: second part of Lecture
14,
Lecture
15,
Lecture
16,
Lecture
17, part of
Lecture
18
- Failures, divergence, and infinite traces: second part of
Lecture
18, Lecture
19, Lecture
20
- Temporal logic and model checking: Lecture
21,
Lecture
22,
Lecture
23
(also contains
some remarks about putting everything together)
Your preferences may vary, but for me the default viewing format (with
a small PIP blackboard) does not work well. I therefore recommend
that you switch the viewing mode to side-by-side. To switch the
viewing mode click on the icon in the lower right corner of the video.
Footnotes
- ... 71
- Failure trace testing was introduced in A Testing Theory for LOTOS using Deadlock Detection by Rom Langerak (in Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX, North-Holland, 1989, pp. 87-98), which does not appear to be available on line. A brief summary is available in this paper
(see Sections 2.2 and 2.3).
- ... note2
- The presentation is largely according to
Model
Checking
(by
Clarke, Grumberg, and Peleg, MIT Press, 1999). The book is
available in the
Library
(printed and also electronic versions, use the search feature on
the Library's main page).