| Name | Affliation | Title |
|
| Sreejith A V | IIT Goa | Regular languages over countable words |
| Soumyadip Bandyopadhyay | BITS Goa | Translation Validation of Loop involving Code Optimizing Transformations using Petri Net based Models of Programs |
| Supratik Chakraborty | IIT Bombay | Counter-example guided repair in Boolean functional synthesis |
| Vrunda Dave | IIT Bombay | On the Separability Problem of String Constraints |
| Priyanka Golia | IIT Kanpur | Program Synthesis as Dependency Quantified Modulo Theory |
| Shibashis Guha | TIFR | Mean-payoff adversarial Stackelberg games |
| Akash Lal | Microsoft Research | Learning-based Controlled Concurrency Testing |
| Missula Meghana | IIT Bombay | Automated inference of production rules for glycans |
| Sumanth Prabhu | TCS Research | Specification Synthesis with Constrained Horn Clauses |
| Govind R | Univ. of Bordeaux, CMI | Partial order reduction for timed systems |
| K V Raghavan | IISc Bangalore | Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains |
| Krishna S | IIT Bombay | Verification of Concurrent Programs under Release Acquire |
| Akshay S | IIT Bombay | Can Zones be used to analyze pushdown timed automata? — a simulations-vs-equivalence story! |
| Rahul Sharma | Microsoft Research | Machine Learning with 2KB RAM |
| Subodh Sharma | IIT Delhi | Analysis of Release-Acquire Concurrency with Partial Order Domain |
| Akshatha Shenoy | TCS Research | Property Directed Self Composition |
| Nishant Sinha | OffNote Labs | The Shape of U — Befriending Tensors |
| Divyesh Unadkat | TCS Research | Exploiting Induction and Difference Computation to Verify Array Programs |