1 / 8

Overview of course CS598MP Spring’05

Overview of course CS598MP Spring’05. modeling. heuristic. spec. seminar paper. Algorithm/thm. Modeling systems with finite data. MOPED. Model-check CTL/mu-calc. Mu-calculus. Regularity of conf of PDA. Binary Decision Diagrams. CTL bisimulations. Emptiness of PDA. Games on

zeke
Download Presentation

Overview of course CS598MP Spring’05

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Overview of course CS598MPSpring’05

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

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

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

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

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

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

  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.

More Related