FI:I022 Verification - Course Information

I022 Design and verification of algorithms

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

prof. RNDr. Luboš Brim, CSc. (lecturer)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Luboš Brim, CSc.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Information Technology (programme FI, B-IN)

Syllabus

• Programs as predicate transformers, weakest precondition, properties of predicate transformers, program correctness.
• Garded command language. Skip and abort commands, composition, alternative command, iterative command.
• Verification of programs, proof outlines, verification rules for sequential composition, alternative, and loop commands. Array manipulation.
• Constructive verification of programs, basic principles and strategies, developing loops from invariants and bounds, developing invarinats.
• Examples of program development. Deriving of efficient algorithms, Searching and sorting.

Literature

• DIJKSTRA, Edsger W. and W. H. J. FEIJEN. A method of programming. Wokingham: Addison-Wesley Publishing Company, 1998, vii, 188 s. ISBN 0-201-17536-3. info
• KALDEWAIJ, A. Programming :the derivation of algorithms. New York: Prentice Hall, 1990, xii, 216 s. ISBN 0-13-204108-1. info
• GRIES, David. The Science of Programming. New York: Springer-Verlag, 1981, 366 s., ob. ISBN 0-387-90641-X. info

Language of instruction

Czech

Further Comments

The course is taught annually.
The course is taught: every week.

Teacher's information

http://www.fi.muni.cz/usr/brim/I022/

• Enrolment Statistics (Autumn 2000, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2000/I022