|
|
COMP2600: Formal Methods for Software Engineering
The 2006 Archive
The Lectures
- 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)
- Haskell, Types and Structural Induction: Lec. 3-8
Lec. 3,4,5 - (ps
or pdf)
Lec. 6,7,8 - (ps
or pdf)
- Automata and Languages - I:
Lec. 9 - 12 - Finite State Machines and Regular Languages
(ps
or pdf)
- Natural Deduction: Lec. 13,14
(ps
or pdf)
- Lambda Calculus: Lec. 15 (ps
or pdf)
- Hoare Logic: Lec. 16,17,18 (ps
or pdf)
- Quiz Review (Sep. 22) (ps
or pdf)
- Weakest Preconditions: Lec. 19,20 (ps
or pdf)
- Z and Specification: Lec. 21,22,23 (ps
or pdf)
- Pushdown Automata (PDAs): Lec. 24 (ps
or pdf)
- Turing Machines, Computability, Complexity: Lec. 25,26
(ps
or pdf)
- Parsing: Lec. 27,28
(ps
or pdf)
- Introduction to Prolog:
Lec. 29 (ps
or pdf)
- Relational Algebra: Lec. 30.
(ps
or pdf)
|
