Program

Venue CSA Lecture Hall (room 117), CSA, IISc.

Schedule
08:00 - 09:00 Registration
08:50 - 09:00 Opening Remarks
09:00 - 10:00 Sławomir Lasota
Automata with timed atoms
10:00 - 10:30 Tea/Coffee/Snacks
10:30 - 11:30 Benjamin Monmege
Logics for Weighted Automata and Transducers
11:30 - 12:30 Matthew Hague
Model-Checking Higher-Order Recursion
12:30 - 14:00 Lunch
14:00 - 15:00 Paul Gastin
Formal methods for the verification of distributed algorithms
15:00 - 15:30 Tea/Coffee/Snacks
15:30 - 16:30 Mohamed Faouzi Atig
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
16:30 - 17:30 S. Akshay
Reachability and regularity problems for Markov chains