Winter Semester 2010
Second exam, 1st April 2011, 08:30 - 10:00, T 211
First exam Thursday, 27th January 2011, 08:30 - 10:00, HS 9
added link to article on Bloom filters to resources
Thursday, 8:30 - 10:15, HS 9.
This lecture is a mandatory course in the Computer Science Master.
Teaching language is English.
This is version 2010.7.
[ mcslides.pdf ]
We will upate the slides during the semester and they are not considered to be complete until the end of the semester.
Exercises will also start in the first week on October 7.
Times, rooms and group assignments may be found on the KUSSS page of this course.
Grading in exercises is based on the quality of written homeworks and presentations in class. There is no final exam. Please see also information about course organization below.
A. Biere. Tutorial on Model
Checking, Modelling and Verification in Computer Science.
V. D'Silva, D. Kröning, Daniel and G. Weissenbacher.
Model Checking: Algorithmic Verification and Debugging. Communications of the ACM, November 2009.
SPIN Model Checker. The Primer and Reference Manual. G. Holzmann, Addison Wesley, 2004.
Space/time trade-offs in hash coding with allowable errors. B. Bloom, Communications of the ACM 13 (7), 1970.
Model Checking. E. Clarke, O. Grumberg, D. Peled. MIT press, 2000.
Modal and Temporal Properties of Processes. C. Stirling. Springer, 2001.
FSMCalc: Finite State Machine Calculator, Leopold Haller, JKU, 2006.
Evaluation code for various string hash functions: testhash.c.
ElSim: elevator simulation.
Boolean satisfiability. From theoretical hardness to practical success. Communications of the ACM, August 2009.
R. Brummayer, A. Biere. Local Two-Level And-Inverter Graph Minimization without Blowup. In Proc. 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'06), Mikulov, Czechia, October 2006.