About me


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.



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

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.


To Assume, Or Not To Assume

for 'Analysis of Computer Systems' group at New York University,
On 16th May 2023


MPI-SWS, Kaiserslautern, Germany

with Georg Zetzsche (Remote)

Jul 2020 - Jun 2021

The internship was in fulfillment of Master's thesis requirement. We worked on the downward closures of Languages with respect to refinements of subword order.

Chennai Mathematical Institute, Chennai, India

with Prajakta Nimbhorkar

Mar 2021 - Aug 2021

The aim of the project was to study some advanced graph problems and known algorithms to solve them, and to see how good they are practically. We looked at the current status of these problems and explored further research directions.

Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France

with Jérôme Leroux and Nathanaël Fijalkow

May 2019 - Jul 2019

In this internship, we worked on solving the games on graphs with combination of winning objectives using separating automata and universal graphs, which have been used in past to solve parity games and mean payoff games. Click here to read the blog post on our work.

Institut de Recherche en Informatique Fondamentale, Paris, France

with Thomas Colcombet and Sylvain Schmitz

May 2018 - Jul 2018

The main aim of the internship was to read the paper, Polynomial vector addition systems with states, and extending the results to other models like Branching-VASS, Reset-VASS, Affine-VASS.



CSR 2022


NFM 2022


DMTCS (Journal)


ESA 2023


Teaching assistance

Complexity theory

MPI-SWS, Oct 2021 - Mar 2022

Discrete mathematics

CMI, Dec 2020 - Feb 2021

Design and analysis of algorithms

CMI, Aug 2020 - Nov 2020

Linear optimisation

CMI, Jan 2020 - Apr 2020

Modern application development

NPTEL, Jan 2020 - Mar 2020

Weighted automata

CMI, Jan 2020 - Feb 2020

Discrete mathematics

CMI, Aug 2019 - Sept 2019

Concurrency theory

CMI, Aug 2019 - Nov 2019


Parā, the annual CMI magazine

Design and Planning