Post-Conference Workshop on Verification of Infinite-State Systems

18th December 2012
International Institute of Information Technology, Hyderabad

Schedule of talks:

Time Speaker Affiliation Title and Abstract
9:00am Alain Finkel ENS Cachan The Theory of Complete WSTS
9:45am Parosh Aziz Abdulla Uppsala University Infinite State Probabilistic Systems
10:30am Tea/Coffee Break
11:00am Mohamed Faouzi Atig Uppsala University Dense-Timed Pushdown Automata
11:45am Gennaro Parlato University of Southampton The Tree-Width of Decidable Problems
12:30pm Lunch
2:00pm Madhusudan Parthasarathy University of Illinois, Urbana-Champaign Synthesizing Programs over Bounded Data Domains
2:45pm Nishant Sinha IBM Research, Bangalore Big-step, Goal-driven Bounded Model-Checking for Software.
3:30pm Tea/Coffee Break
3:50pm Prakash Saivasan Chennai Mathematical Institute Verifying multi-pushdown systems
4:20pm K. Vasanta Indian Institute of Science, Bangalore Model-checking Presburger Counter Systems Using Accelerations
4:50pm Prateek Karandikar Chennai Mathematical Institute An introduction to the Post Embedding Problem


Deepak D'Souza, IISc Bangalore (deepakd@csa.iisc.ernet.in)
K Narayan Kumar, CMI Chennai (kumar@cmi.ac.in)
Anil Seth, IIT Kanpur (seth@cse.iitk.ac.in)