T-79.190 Testing of Concurrent Systems (2 cr)
correspondence in form or appearance.|
This class was lectured last time in Autumn 2002,
and will be lectured next time in Autumn 2004. The class
was not lectured in 2003.
This is a class on formal conformance testing.
Subjects covered this year include but are not limited to:
- Introduction to conformance testing
- Formal conformance testing and its automatisation
- Testing of timed and infinite-state systems
- Estimation of testing coverage
Please read the brochure
(it is written in Finnish).
- Lectures by M.Sc. (Tech) Antti Huima (email@example.com):
Tuesdays 8-10 am, T3.
First lecture 14th September 2004.
- Tutorials by the lecturer:
Tuesdays 10-11 am, T3.
- Class material:
Lectures, lecture notes, tutorials, and tutorial model solutions.
- In order to pass the class one has to
- pass the exam (with a grade greater than 0).
- Newsgroup: The newsgroup opinnot.tik.t79190
is available for general discussion regarding the subject matter of
the class. However, all official information is present only in the
web. All questions and inquiries related to the class should be
sent via e-mail to the lecturer.
- Next examinations:
- Thursday 16th December, from 4 to 7 pm, T1/T2.
- Requirements for examination:
Back to menu.
Schedule and Material
||Introduction. Main framework.
Concurrent Scheme as process notation.
Handouts chapters 1 and 2
(22 pages, PDF)
Slides lectures 1-20 [6 mostly black-and-white slides per page for printing]
Implementations. Testing strategies. Execution.
2.1, 2.2, 2.3, 2.5 from the handouts
Test steps and execution. Test verdicts.
||This week's lectures and tutorials were originally cancelled, but
they can be given after all.
||Lectures cancelled due to personal reasons
||Handouts chapter 3
(9 pages, PDF)
Does not cover the on-the-fly testing algorithm. Algorithms
come later in the handouts.
||Exercises 2.4, 2.6 from the handouts
Scheme programs as implementations, testing strategies, testers,
|43||19.10.2004||Yes||[Continued with previous exercises]
Conformance is trace inclusion.
Basic on-the-fly testing algorithm.
|44||26.10.2004||Yes||Exercises 3.1, 3.2, 3.3, 3.4, 3.5, 3.6 from the
Basic economics of testing.
||Handouts chapter 4-6
(12 pages, PDF)
||Testing algorithms. Trace inclusion checking. Planning.
CANCELLED DUE TO BUS DRIVERS' STRIKE
||Symbolic testing algorithms. Symbolic trace inclusion
checking. Implementation issues.
||The IOCO testing theory and its critique.
|50||7.12.2004||Yes||No||Conclusions and voluntary
Voluntary pre-examination for those who want to estimate their current
level of learning.
||Pre-examination questions (IN FINNISH, 5 pages, PDF)
||[ no slides ]
EXAMINATION 4-7 PM (T1 / T2)
Handouts in print
The following table summarizes handouts that have been delivered to
printing and delivery. The date corresponds to the time when the
handouts have been handed to the Editor (this year Mr. Kimmo
Note: slides are not distributed via Edita, because
equivalent material is already available in the official handouts.
||Handouts chapters 1 and 2
||Handouts chapter 3
||Handouts chapters 4-6
Back to menu.
Give course feedback via web
Old examinations for download
From here you can download (in PostScript form) previous examinations
for this class. NOTE THAT THE CONTENT OF THE CLASS HAS BEEN DEVELOPED
FURTHER AND THAT THESE EXAMINATIONS ARE BASED ON THE OLD CONTENT.
Latest update: 25 January 2005.