Student Symposium on Verification, Automata and Games

October 28-29, 2017

About

The Student Symposium on Verification, Automata and Games attempts to provide a platform for students of CMI to showcase the research that they have done over the course of the last year in verification, automata theory and games in various universities and labs across the world. The symposium will consist of a series of 10 talks spread over two days.

Programme

Schedule for October 28

Time Title Speaker
9:30 - 10:10 On the fly algorithms for Reachability and Safety Games Thejaswini K S
10:10 - 10:20 Short Break
10:20 - 11:00 Asynchronous Distributed Games with Causal Memory Debraj Chakraborty
11:00 - 11:30 Coffee Break
11:30 - 12:10 Piecewise Testable Index of Words and Its Algorithmic Evaluation Ritam Raha
12:10 - 1:30 Lunch
1:30 - 2:10 Width of Non-Deterministic Automata Anirban Majumdar
2:10 - 2:20 Short Break
2:20 - 3:00 Verification of message passing programs Mirza Ahad Baig
3:00 - 3:30 Coffee Break


Schedule for October 29

Time Title Speaker
9:30 - 10:10 Separation problem with modular predicates Varun Ramanathan
10:10 - 10:20 Short Break
10:20 - 11:00 Parameterized verification of broadcast protocols under various constraints Balasubramanian A R
11:00 - 11:30 Coffee Break
11:30 - 12:10 Symbolic Decision Diagrams with Equality Relations Suman Sadhukhan
12:10 - 1:30 Lunch
1:30 - 2:10 TSO non-robustness in programs robust under concurrency Rajarshi Roy
2:10 - 2:20 Short Break
2:20 - 3:00 Reprogramming Asynchronous Boolean Networks Aalok Thakkar
3:00 - 3:30 Coffee Break

Venue

Seminar Hall, Chennai Mathematical Institute,
H1, SIPCOT IT Park,
Siruseri, Kelambakkam 603103