| Name | Affliation | Title |
|
| Sreejith A V | IIT Goa | Formal methods in machine learning |
| Srivathsan B | CMI | Suffix-reading automata and their synthesis problem |
| Soumyadip Bandyopadhyay | NVidia | Equivalence checking of Programs for Translation Validation |
| Deepak D'Souza | IISc Bangalore | Symbolic Fixpoint Algorithms for Logical LTL Games |
| Pranshu Gaba | TIFR Mumbai | Stochastic Window Mean-payoff Games |
| Alvin George | IISc Bangalore | Verifying Temporal Properties of Control Systems using Abstraction Refinement |
| Pankaj Kumar Kalita | IIT Kanpur | Program Synthesis beyond Programs |
| Pankaj Kumar Kalita | IIT Kanpur | Synthesizing Abstract Transformer |
| Rajesh Kumar | BITS Pilani | RESilience-by-DEsign (RESIDE) - a decision theoretic framework for optimal incident response and damage control using statistical model checking |
| Prince Mathew | IIT Goa | One-deterministic-counter automata |
| Ravindra Metta | TRDDC Pune | (Non-)termination checking via tests |
| Madhavan Mukund | CMI | Undecidability of distributed games with causal memory |
| Dhruv Nivetia | ETH Zurich | Weighted first order logic and weighted automata |
| Habeeb P | IISc Bangalore | Verification of Camera-Based Autonomous Systems |
| Ramchandra Phawade | IIT Dharwad | Decidability results for free choice time petri nets |
| Sumanth Prabhu S | TRDDC Pune | Weakest Quantified Preconditions for Linear Array Programs |
| Suresh S. P | CMI | The secrecy problem for protocols with assertions |
| Abhisekh Sankaran | TRDDC Pune | First order Skolem function synthesis over finite structures |
| Rahul Sharma | Microsoft Research, Bangalore | Large language models meet program synthesis |
| Sanjana Singh | IIT Delhi | Optimal Stateless Model Checking based on View-equivalence |
| Saina Sunny | IIT Goa | Deciding edit-distance between transducers |