- Introduction to Specifications (1 week, Introduction)
- Specifying Algorithms (1 week, Chapter 1)
Pre and post conditions.
- Verifying Algorithms (3 weeks, Chapters 2-3)
Basic Techniques. Verification Tableaux. Loop invariants. Examples.
- Introduction to Formal Languages (1 week, Chapter 7)
Strings. Languages. Basic operations on languages. Classes of languages.
- Regular Languages (2 weeks, Chapters 8-9)
Finite state automata. Regular expressions. Non-determinism.
- Context-free Languages (2 weeks, Chapters 10-11)
Grammars and push-down automata. Recursive-descent parsing.
- Introduction to Computability (1 week, Chapter 12)
This page was last modified on September 12, 2011.