PROFESSIONAL PATH
About me
Namaste!
I am doctoral student in the Rigorous Software Engineering group at Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany. I am advised by Rupak Majumdar and Anne-Kathrin Schmuck.
I am currently interested in games on finite graphs, synthesis of reactive systems and concurrency theory.
Prior to this, I graduated with a Masters in Computer Science, and Bachelors in Mathematics and Computer Science from Chennai Mathematical Institute in India.
I love reading poetry, and playing Minecraft.
I am co-organizing a students talk series OFCOURSE, on the theory of verification and synthesis. If you are a PhD student and would like to give a talk, please get in touch.
EXPERIENCE
Publications
Permissiveness for Strategy Adaptation
with Satya Prakash Nayak, and Anne-Kathrin Schmuck.
under review
Best poster award, HSCC'23
Synthesizing Permissive Winning Strategy Templates for Parity Games
with Satya Prakash Nayak, and Anne-Kathrin Schmuck.
to appear in CAV, 2023
Computing Adequately Permissive Assumptions for Synthesis
with Kaushik Mallik, Satya Prakash Nayak, and Anne-Kathrin Schmuck.
TACAS, 2023
For parity games, which are canonical representations of $\omega$-regular games, we present a polynomial-time algorithm for the symbolic computation of \emph{adequately permissive assumptions} and show that our algorithm runs faster and produces better assumptions than existing approaches---both theoretically and empirically. To the best of our knowledge, for \emph{$\omega$-regular} games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also \emph{permissive}.
New Algorithms for Combinations of Objectives using Separating Automata
with Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, and Pierre Ohlmann.
International Symposium on Games, Automata, Logics, and Formal Verification, GandALF, 2021.