ACM SIGPLAN Distinguished Paper Award
For the OOPSLA paper on algebro-geometric synthesis of polynomial programs.
Formal methods · artificial intelligence · mathematical foundations
Reliable reasoning under
nonlinearity and uncertainty
I develop mathematical and algorithmic methods for computational systems that must reason in a world shaped by complex interactions, incomplete information, and chance.
01 / Intellectual journey
One question led me here
From polynomial equations to reliable computation
My path crosses mathematics, formal methods, AI, algorithms, and control. The applications have changed; the method has remained consistent: expose structure, use it to choose the computation, and certify the result.
-
2015–2020
IIT Kharagpur
Integrated Bachelor’s and Master’s in Mathematics and Computing. My academic journey began with polynomial equations, Gröbner bases, graphical models, and combinatorial geometry.
-
2021–2023
Ghent University
PhD in Mathematics: Algebra and Geometry. My thesis developed algebro-geometric algorithms for program synthesis, tensor networks, and conditional independence models.
-
2023–2024
HKUST
Postdoctoral Fellow, ALPACAS Research Group. Approximate quantifier elimination, Skolem synthesis, and parameterized algorithms.
-
2024–2025
MPI-SWS
Postdoctoral Researcher. Probabilistic programs, randomized distributed algorithms, and stochastic reachability.
-
2026–
TU Wien
Postdoctoral Researcher, Automated Program Reasoning Group. Non-linear reasoning, abstract interpretation, weighted model integration, and randomized algorithms.
02 / Profile & recognition
Research shaped across disciplines
A record spanning mathematics, programming languages, formal methods, artificial intelligence, algorithms, and control.
18peer-reviewed publications
2best-paper distinctions
3competitive fellowships
IEEE Computer Society Larson Best Paper Award
Best student paper recognition for the same foundational synthesis work.
Competitive research fellowships
BOF doctoral fellowship, FWO SofinaBoël fellowship, and HKUST postdoctoral matching fellowship.
Institute Silver Medal
Highest CGPA in Mathematics and Computing at IIT Kharagpur, together with the Best Master's Project award.
03 / Research
One recurring question
How can hidden mathematical structure become an algorithmic advantage, without giving up reliability?
My work begins where two simplifying assumptions disappear: the system is no longer linear, and its behaviour is no longer deterministic. I use algebra, geometry, combinatorics, probability, and logic to expose structure; then I turn that structure into algorithms whose conclusions can be checked.
Discover efficiently
Certify what we find
Three pillars
One mathematical core
Each pillar addresses a different part of trustworthy computation. Together, they connect how we represent a problem, where we search, and how we certify the result.
I
When equations resist
Geometry-aware non-linear reasoning
Polynomial constraints appear throughout verification, synthesis, and symbolic AI. I use intrinsic dimension, fibre geometry, and sparse variable interactions to guide elimination and witness construction.
- Certified approximate quantifier elimination
- Skolem functions and program synthesis
- Approximate elimination and sparse algorithms
II
When chance enters
Certified stochastic systems
Randomized choices and environmental noise turn finite programs into infinite families of behaviours. I develop compact certificates for termination, reachability, and safety.
- Almost-sure termination
- Stochastic reachability certificates
- Finite certificates for infinite behaviours
III
When geometry guides the search
Inference and randomized computation
I study the geometry of probabilistic models and use geometric information to design better proposal spaces for randomized algorithms, over both the reals and finite fields.
- Algebraic geometry of probabilistic models
- Weighted model integration
- Randomized search with deterministic checking
04 / Selected contributions
A research arc across disciplines
Selected work showing how the same structural viewpoint moves from mathematical foundations to certifying computational methods.
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
A parallel framework for analysing polynomial programs while preserving the semantic guarantees required for verification.
Read the paperAlmost-Sure Termination for Randomized Distributed Algorithms
Reduces a global probabilistic property over unbounded executions to finite symbolic obligations.
Read the paperRandomized Satisfiability Checking over Finite Fields
Uses randomization to accelerate discovery while checking every proposed solution deterministically.
Read the paperAlgebro-Geometric Algorithms for Template-Based Synthesis of Polynomial Programs
Transforms program synthesis into a geometric problem while returning compact programs that can be independently checked.
ACM SIGPLAN Distinguished Paper · IEEE Larson Best Paper
Read the paper
05 / Publications
Publications
18 peer-reviewed publications
Author order follows the alphabetical conventions of mathematics and theoretical computer science.
Download publication list- 2026The Bounded Treedepth of Programs and Treedepth-guided CDCL
SETTA 2026 · Accepted
- 2026
- 2026On Certificates for Almost Sure Reachability in Stochastic Systems
IEEE Transactions on Automatic Control
- 2026
- 2026
- 2025
- 2025Quantified Linear and Polynomial Arithmetic Satisfiability via Template-Based Skolemization
AAAI 2025 · Oral presentation
- 2025
- 2024
- 2024
- 2024
- 2024Global Rigidity of Line Constrained Frameworks
SIAM Journal on Discrete Mathematics
- 2023Algebro-Geometric Algorithms for Template-Based Synthesis of Polynomial Programs
OOPSLA 2023 · Two best-paper distinctions
- 2023Matroid Stratifications of Hypergraph Varieties, Their Realization Spaces, and Discrete Conditional Independence Models
International Mathematics Research Notices
- 2023The Leading Coefficient of Lascoux Polynomials
Discrete Mathematics
- 2022
- 2022Computing Maximum Likelihood Estimates for Gaussian Graphical Models with Macaulay2
Journal of Software for Algebra and Geometry
- 2022Conditional Probabilities via Line Arrangements and Point Configurations
Linear and Multilinear Algebra
06 / Teaching & supervision
From concrete questions to abstraction and proof
I teach mathematics and theoretical computer science by beginning with a problem students can interrogate, then developing the abstraction needed to solve it rigorously.
My teaching approach
Students learn difficult ideas best when they can move between examples, algorithms, and proof. I aim to make that movement explicit, and to create classrooms where asking a precise question is treated as part of doing mathematics.
My teaching spans algebra, algorithms, complexity, and the mathematical foundations of computing.
Complexity Theory
Teaching Assistant · RPTU Kaiserslautern-Landau
Design and Analysis of Algorithms
Guest Lecturer · HKUST
Blockchain, Cryptocurrencies and Smart Contracts
Guest Lecturer · HKUST
Modern Algebra and Gröbner Bases
Teaching and Laboratory Assistant · IIT Kharagpur
Supervision & mentorship
Bachelor's research supervision
Supervised projects at Ghent University and mentored a joint Ghent University–IIT Kharagpur project in algebraic geometry and computation.
Individual research development
I help students identify a tractable question, locate the mathematical core, and grow from exploratory computation toward a clear research argument.
07 / Academic service
Contributing to the research community
My service connects dependable software engineering, formal methods, logic, and mathematical research communities.
Program committees
SETTA 2024–2026
Symposium on Dependable Software Engineering.
MARBLE 2026
Mathematical Research for Blockchain Economy.
Peer review
FMCAD · LICS · FM · TACAS
Reviewer for leading venues across formal methods, logic, and computer-aided verification.
Community building
Seminars and mentorship
Organized reading seminars in real algebraic geometry, stochastic processes, toric geometry, and junior algebra and geometry; continued mentorship of students exploring research careers.
08 / Talks
Talks & presentations
Selected presentations across formal methods, algorithms, and mathematical foundations.
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
CAV · International Conference on Computer Aided Verification
Randomized Satisfiability Checking for Non-Linear Arithmetic over Finite Fields
FMCAD · Formal Methods in Computer-Aided Design, Graz
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
Highlights 2026 · Highlights of Logic, Games and Automata, Vienna
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic
Workshop on Counting, Sampling, and Synthesis · July 2026
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic
QuantFormal · Highlights of Logic, Games and Automata
Practical Approximate Quantifier Elimination for Non-Linear Real Arithmetic
FM, Formal Methods
Approximate Quantifier Elimination and Program Synthesis
SAT, International Conference on Theory and Applications of Satisfiability Testing
Algebro-Geometric Algorithms for Formal Verification and Synthesis of Programs
Hausdorff Institute trimester program
09 / Contact