COMP2600: Formal Methods for Software Engineering

The 2007 Archive

Pre-requisite mathematics:
Lec. 1: Basic logic that we'll assume (ps or pdf)
Lec. 2: Basic set theory that will be assumed (ps or pdf)
Lec. 3: A quick revision of Haskell (ps or pdf)
Here is the version also containing extra slides from last year that were skipped in the lecture (ps or pdf)
Natural Deduction: Lec. 4-6 (ps or pdf)
Soundness and Completeness: Lec. 6 (ps or pdf)
Automata and Languages - I:
Lec. 7 - 9 - Finite State Machines and Regular Languages (ps or pdf)
Inductive Types and Structural Induction: Lec. 10-12 (ps or pdf)
Hoare Logic: Lec. 13-15 (ps or pdf)
Lambda Calculus: Lec. 16 (ps or pdf)
Weakest Preconditions: Lec. 17,18 (ps or pdf)
Quiz Review (Aug. 28) (ps or pdf)
Z and Specification: Lec. 19,20,21 (ps or pdf)
Pushdown Automata (PDAs): Lec. 22 (ps or pdf)
Turing Machines: Lec. 23 (ps or pdf)
Grammars: Lec. 24 (ps or pdf)
Parsing: Lec. 27,28 (ps or pdf)
Introduction to Prolog: Lec. 29 (ps or pdf)
Computability & Complexity: Lec. 30. (ps or pdf)
Review Lectures - sample exam question (ps or pdf)


	College of Engineering and Computer Science Research School of Computer Science