COMP60332: Automated Reasoning and Verification (2015-2016)
Lectures start on Friday 5 February 2016
Follow this link for the course unit description, giving details about
the aims and learning outcomes of the course, reading material,
assessment, and the syllabus.
Locations and times
Refer to the ACS and MEng
Timetables for dates.
There will be weekly assignments, with strict weekly deadlines.
Handing in your work
Please hand in your written coursework as a hard copy to the Student Support Office, Room LF21.
We will be assuming familiarity with the basic notions of sets,
relations and functions. This
will not be covered in lectures, but will be part of the first coursework
If you feel you want to review these notions we
suggest you refer to one of:
- The chapter entitled "Sets etc" in
Cormen, T. H. and Leiserson, C. E. and Rivest, R. L. (1992),
Introduction to Algorithms.
The MIT Electrical Engineering and Computer Science Series,
In some editions it is in Chapter 5.2, and in others it is in the Appendix.
- Chapters 1.1, 1.2 and 1.3 of
"Interactive Real Analysis".
This website includes interactive exercises with answers.
- Any book on the mathematical foundations of CS or discrete mathematics.
Knowledge of propositional logic and first-order logic
would be some advantage, but is not essential as the course will
The course does not follow a specific book: copies
of the slides are made available.
Recommended reading material is listed in the
course unit description in the ACS Syllabus.
Further references may be given during lectures.
There is no need to buy a book.
All books are available in the Resources Centre Library (ask in SSO) or the main library.
50% coursework, 50% exam
Renate A. Schmidt
FM Group |
School Computer Science |
Last modified: 25 Jan 16
Copyright © 2015-16
Renate A. Schmidt,
School of Computer Science, Man Univ, firstname.lastname@example.org