Formal Methods Update 2006
Department of Computer Science & Engineering,
IIT Guwahati
3-6 July 2006

 Supported by

HomeProgramme ParticipantsPrevious UpdatesGetting to IITGRegistrationTravel SupportContact Us

 

 The following is the final schedule of lectures.

All lectures will be held in the Gallery G1 in the Academic Complex.

3 July, Monday
09:30 - 10:00    Registration and Welcome
10:00 - 11:15    M. Mukund (Parity Games)
11:15 - 11:45    Tea Break
11:45 - 13:00    N. Kumar (LTL and Expressive Completeness)
13:00 - 14:30    Lunch Break
14:30 - 15:45    A. Meyer (Infinite state verification)
15:45 - 16:15    Tea Break
16:15 - 17:15    P. Pandya (Timed Logics)

4 July, Tuesday
09:30 - 10:00    S. Basu (Rough Grammar)
10:00 - 11:15    M. Mukund (Parity Games)
11:15 - 11:45    Tea Break
11:45 - 13:00    N. Kumar (LTL and Expressive Completeness)
13:00 - 14:30    Lunch Break
14:30 - 15:45    R. Ramanujam (Infinite state verification)
15:45 - 16:15    Tea Break
16:15 - 17:15    P. Pandya (Timed Logics)

5 July, Wednesday
09:30 - 10:00    S. Roy (Symbolic Verification)
10:00 - 11:15    A. Seth (Quantitative Games)
11:15 - 11:45    Tea Break
11:45 - 13:00    N. Raja (Gödel's Theorem)
13:00 - 14:30    Lunch Break
14:30 - 15:45    K. Lodaya (Infinite state verification)
15:45 - 16:15    Tea Break
16:15 - 17:15    Discussion

6 July, Thursday
09:30 - 10:00    A. Nori (SYNERGY)
10:00 - 11:15    A. Seth (Quantitative Games)
11:15 - 11:45    Tea Break
11:45 - 13:00    A. Meyer (Infinite state verification)
13:00 - 14:30    Lunch Break
14:30 - 15:30    Bharat Adsul (Parity Games)
15:30 - 15:45    Discussion and Closing
15:45 - 16:15    Tea

Tutorials/Lectures

  1. Automata theoretic aspects of infinite state verification
    Lecturers: Antoine Meyer, Kamal Lodaya and R. Ramanujam (IMSc)
    4 lectures Lecture Slides (R.Ramanujam) A. Meyer (Lecture 1 Lecture 2)
  2. Parity Games
    Lecturers: Madhavan Mukund and Bharat Adsul (CMI)
    3 lectures Lecture 1 slides Lecture 1 slides (handout) Lecture 2 slides Lecture 2 slides (handout)
  3. LTL and Expressive Completeness
    Lecturers: Narayan Kumar (CMI)
    2 lectures Lecture 1 slides Lecture 2 slides
  4. Quantitative and Stochastic Games
    Lecturer: Anil Seth (IIT Kanpur)
    2 lectures
  5. Expressiveness and Decidability in Timed Logics: Some Recent Advances
    Lecturer: Paritosh Pandya (TIFR)
    2 lectures Lecture slides

Gödel Centenary Lecture
An Incomplete Recapitulation of Gödel's Theorem
Lecturer: N. Raja (TIFR)

Research/Experience Talks
  1. Sumita Basu (Lady Brabourne College, Kolkata): Rough Grammar and Rough Language
  2. Aditya Nori (Microsoft Research): SYNERGY: A New Algorithm for Property Checking
  3. Suman Roy (Honeywell): Symbolic Verification of Infinite Systems modeled as CFSMs using a Finite Union of DFAs