Week |
Dates |
Topic |
Slides |
PS |
01 |
Aug. 24 |
Course Introduction and Administrivia |
|
|
Aug. 26 |
Regular Languages: Deterministic Finite Automata (DFA) |
|
02 |
Aug. 31 |
In-Class Problem Solving Session 01 |
|
|
Sep. 02 |
Non-Deterministic Finite Automata (NFA) |
|
|
03 |
Sep. 07 |
Labor Day Holiday |
Sep. 09 |
Closure Properties and Equivalence |
|
|
04 |
Sep. 14 |
Regular Expressions |
| |
Sep. 16 |
Pumping Lemma and Non-Regular Languages |
|
|
05 |
Sep. 21 |
Context-Free Languages (CFL): |
|
|
Sep. 23 |
Context-Free Grammars |
|
|
06 |
Sep. 28 |
midterm exam i |
Sep. 30 |
Push-Down Automata (PDA), Normal Forms |
|
|
07 |
Oct. 05 |
Pumping Lemma for CFL |
|
|
Oct. 07 |
CFL Properties and Equivalence |
|
|
08 |
Oct. 12 |
Recursively-Enumerable Languages (REL): |
|
|
Oct. 14 |
Recursive vs. REL |
|
|
09 |
Oct. 19 |
Turing Machines (TM) |
|
|
Oct. 21 |
|
|
10 |
Oct. 26 |
Halting Problem |
|
|
Oct. 28 |
midterm exam ii |
11 |
Nov. 02 |
-- buffer space for fallover -- |
|
|
Nov. 04 |
Computational Complexity: Undecidability |
|
|
12 |
Nov. 09 |
Complexity Classes: P, NP, NP-C |
|
|
Nov. 11 |
P vs. NP |
|
|
13 |
Nov. 16 |
Satisfiability, Cook’s Theorem |
|
|
Nov. 18 |
Church-Turing Thesis |
|
|
14 |
Nov. 23 |
thanksgiving break |
Nov. 25 |
15 |
Nov. 30 |
Using Timed-Automata to Solve Scheduling Problems (Cafarelli) |
|
|
Formal Verification of Cryptographic Protocols (Collins) |
|
|
Dec. 02 |
Formal Verification of Routing Protocols for Ad-Hoc Networks (Da) |
|
|
Applications of Category Theory (Goedelman) |
|
|
16 |
Dec. 07 |
Distributed Scheduling w.r.t. Mean Response Time (Kalliongis) |
|
|
Formal Verification Using Model Checking Tools (Polapragada) |
|
|
Dec. 09 |
Survey of Proof Carrying Code (Rangaraju) |
|
|
Model Checking: Using Programs to find the Fault in Your Logic (Shovlin) |
|
|
17 |
Dec. 14 |
finals week |
Dec. 16 |