1. Overview of course CS598MP Spring’05

2. Modeling FSM, PDA Emptiness of PDA Games on FSMs Binary Decision Diagrams CTL bisimulations Mu-calculus Model-check CTL/mu-calc Regularity of conf of PDA MOPED Modeling systems with finite data heuristic modeling spec seminar paper Algorithm/thm

3. Modeling FSM, PDA LTL LTL and automata heuristic modeling spec seminar paper algorithm Emptiness of Buchi automata Omega Buchi automata Mu-calculus Nested DFS algorithm LTL Model-checking

4. Binary Decision Diagrams heuristic modeling spec seminar paper Abstraction Abstract Interpretation Graf-Seidi Predicate abstraction Cartesian abstraction MOPED Abstraction in SLAM; Boolean programs CVC

5. heuristic modeling spec seminar paper SAT-based model-checking Bounded Model Checking Using SAT SAT Internals of a SAT Solver: Search, conflict clause Learning, boolean Constraint propogration, etc. Interpolation and SAT-based Model-checking SATURN

6. heuristic modeling spec seminar paper Handling the heap: shape analysis TVLA: Shape-based Program analysis Finding abstract Shape transformers Abstracting data-structures as shapes, FOL Heuristics: -Focusing -instrumentation predicates Analysing memory accesses in x86

7. heuristic modeling spec seminar paper Other seminar papers Random Interpretation Summarizing procedures in concurrent programs: Transactions Timed automata

8. There is more theory! – course next semester regular languages, MSO on words and Buchi-Traktenbrot theorem; omega-regular languages, MSO, and Buchi's theorem; omega-regular tree languages, MSO, parity games, Rabin's theorem; FO on words, temporal and tense logics, Kamp's theorem; mu-calculus and parity games; alternating automata; temporal logics; decision problems for logic including model checking and satisfiability; FO and SO on finite graphs; connections to complexity; EF-games; decidable logics on infinite graphs; other decidable theories like Presburger arithmetic and FO on reals.