A revised version of the syllabus is available.
120 credits with 30 credits in mathematics and 30 credits in computer science, including basic programming, data structures, and elementary logic.
After completing this courses students will understand what it means to
write rigorous descriptions of implementations and specifications of programs,
verify programs, i.e. prove that the implementation of a program meets its specification, and
synthesise programs, i.e. to derive a correct program from a given specification.
The course will contain the following topics:
logical proofs, specification and correctness of programs, weakest preconditions, invariants, partial correctness, termination proofs, total correctness, and program synthesis.
Lectures and tutorials.
Written exam and assignments.
Some titles may be available electronically through the University library.
Find in the library
Read more about cookies.