## 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 interested in synthesis and verification of
distributed systems.

In 2023, I visited the Automated Reasoning Group at AWS for an
internship.

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.

## Publications

#### Verifying Unboundedness via Amalgamation

with Sylvain Schmitz, Lia Schütze and Georg Zetzsche.

at LICS, 2024

#### Contract-Based Distributed Synthesis in Two-Objective Parity Games

with Satya Prakash Nayak, and Anne-Kathrin Schmuck.

at HSCC'24

Best poster award, HSCC'23

#### Priority Downward Closures

with Georg Zetzsche.

at CONCUR, 2023

#### Synthesizing Permissive Winning Strategy Templates for Parity Games

with Satya Prakash Nayak, and Anne-Kathrin Schmuck.

at CAV, 2023

#### Computing Adequately Permissive Assumptions for Synthesis

with Kaushik Mallik, Satya Prakash Nayak, and Anne-Kathrin
Schmuck.

at 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.

at GandALF, 2021.

## Talks

#### To Assume, Or Not To Assume

at 'Dagstuhl Seminar 24171' in Dagstuhl, Germany,

On 26th April 2024

for 'Theory Seminar' at UMass, Amherst,

On 20th February 2024

at Highlights'23, Kassel, Germany,

On 25th July 2023

for 'Analysis of Computer Systems' group at The Courant
Institute of Mathematical Sciences, NYU,

On 16th May 2023

#### How to Play in a Team

for 'Advanced Automata Theory' course at RPTU,
Kaiserslautern,

On 14th July 2023

## Internships

#### Amazon Web Services, New York City, USA

in the Automated Reasoning Group

Nov 2023 - Feb 2024

#### Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France

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

May 2019 - Jul 2019

#### Institut de Recherche en Informatique Fondamentale, Paris, France

with Thomas Colcombet and Sylvain Schmitz

May 2018 - Jul 2018

## Review

#### CSR 2022

Sub-reviewer

#### NFM 2022

Sub-reviewer

#### DMTCS (Journal)

Sub-reviewer

#### ESA 2023

Sub-reviewer

## 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