Overview of course CS598MPSpring’05

Modeling FSM, PDA

Emptiness of PDA

Games onFSMs

BinaryDecision

Diagrams

CTLbisimulations

Mu-calculus

Model-checkCTL/mu-calc

Regularity of conf of

PDA

MOPED

Modeling systems with finite data

heuristicmodelingspec

seminar paperAlgorithm/thm

Modeling FSM, PDA

LTL

LTL and automata

heuristicmodelingspec

seminar paperalgorithm

Emptiness of Buchiautomata

OmegaBuchi

automata

Mu-calculusNested

DFSalgorithm

LTLModel-checking

BinaryDecision

Diagrams

heuristic

modeling

specseminar paper

Abstraction

Abstract Interpretation

Graf-SeidiPredicate

abstraction

Cartesianabstraction

MOPED Abstractionin SLAM;Boolean

programs

CVC

heuristic

modeling

specseminar paper

SAT-based model-checking

BoundedModel Checking

Using SAT

SAT

Internals of a SAT Solver:

Search, conflict clauseLearning, boolean

Constraint propogration,etc.

Interpolationand SAT-basedModel-checking

SATURN

heuristic

modeling

specseminar paper

Handling the heap: shape analysis

TVLA:Shape-based

Program analysis

Finding abstractShape transformers

Abstractingdata-structures

as shapes,FOL

Heuristics: -Focusing -instrumentation predicates

Analysing memory accessesin x86

heuristic

modeling

specseminar paper

Other seminar papers

Random Interpretation

Summarizing proceduresin concurrent programs:

Transactions

Timed automata

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.