|
|
COMP2600: Formal Methods for Software Engineering
The 2009 Archive
Lecture Slides and Supporting Material
- Revision: Propositional Logic, Predicate Calculus
Week 1, Monday
Slides:
[pdf]
[pdf 2×2]
- Revision: Sets, Functions, Relations, Induction
Week 1, Thursday
Slides:
[pdf]
[pdf 2×2]
- Revision: Basic Haskell
Week 2, Monday
Slides:
[pdf]
[pdf 2×2]
- Natural Deduction
Week 2, Wednesday
Slides:
[pdf]
[pdf 2×2]
[Propositional Calculus Rules]
- Natural Deduction (continued)
Week 2, Friday
Slides:
[pdf]
[pdf 2×2]
[Predicate Calculus Rules]
- Soundness, Completeness and Consistency
Week 3, Monday
Slides:
[pdf]
[pdf 2×2]
- Types and Recursion
Week 3, Thursday
Slides:
[pdf]
[pdf 2×2]
Example code:
[Expression.hs]
- Structural Induction
Week 3, Friday
Slides:
[pdf]
[pdf 2×2]
- Structural Induction (continued)
Week 4, Monday
Slides:
[pdf]
[pdf 2×2]
- Hoare Logic
Week 4, Thursday & Friday; Week 5, Monday
Slides:
[pdf]
[pdf 2×2]
- Weakest Preconditions
Week 5, Thursday & Friday; Week 6, Monday
Slides:
[pdf]
[pdf 2×2]
- Lambda Calculus
Week 6, Thursday
Slides:
[pdf]
[pdf 2×2]
[Lambda Calculus
Workbench]
[Mt. Lambda, near
Kyoto U.]
- Church Encoding
Week 6, Friday
Slides:
[pdf]
[pdf 2×2]
- Type Checking
Week 7, Thursday
(Back to the lambda calculus...)
Slides:
[pdf]
[pdf 2×2]
- Finite State Automata & Regular Languages
Week 7, Friday; continuing later
Slides:
[pdf]
[pdf 2×2]
- Finite State Automata & Regular Languages
Week 8, Friday; Week 9, Monday
Slides:
[continued from week 7 - see above.]
- Language and Grammars
Week 9, Thursday
Slides:
[pdf]
[pdf 2×2]
- Push-Down Automata
Week 9, Friday
Slides:
[pdf]
[pdf 2×2]
- Introduction to Parsing
Week 10, Monday
Slides:
[pdf]
[pdf 2×2]
Example code:
[ParseTypeDefs.hs]
[Expression Evaluator]
- Turing Machines
Week 10, Thursday
Slides:
[pdf]
[pdf 2×2]
- Complexity and Computability
Week 10, Friday
Slides:
[pdf]
[pdf 2×2]
|
