
S Akshay  IIT Bombay  On Skolem's problem with applications to program termination and probabilistic verification 
Deepak D'Souza  IISc Bangalore  Some recent techniques for verifying concurrent programs 
Kamal Lodaya  IMSc Chennai  50 years of the KrohnRhodes theorem 
Chinmay Narayan  IIT Delhi  Verification of Parametrized Concurrent Programs 
K Narayan Kumar  CMI Chennai  Verification of Concurrent Recursive Programs 
Aditya Nori  MSR Bangalore  Probabilistic Programming: A Program Analysis Perspective 
Paritosh Pandya  TIFR Mumbai  In quest of Kamp Theorems for Metric Temporal Logic 
Sathya Peri  IIT Patna  Software Transactional Memory Systems 
Komondoor Raghavan  IISc Bangalore  A survey of selected techniques for precise program slicing 
Gautham Shenoy R  CMI  Proving properties of concurrent data structures 
Parag Singla  IIT Delhi  Markov Logic: Combining Logic and Probability 
B Srivathsan  CMI Chennai  Reachability in timed and probabilistic systems 
Vaishnavi Sundararajan  CMI  From LTL to deterministic omegaautomata 
Ashutosh Trivedi  IIT Bombay  Streaming String Transducers 
R Venkatesh  TRDDC Pune  Formal notations to specify reactive systems 