I’m a second year PhD student at the LSV, ENS Paris Saclay. I am working on analysing underapproximations for the verification of distributed systems which communicate asynchronously via buffers of unbounded size.
2017-19 Ecole Normale Superieure Paris Saclay MPRI (Master Parisien de Recherche en Informatique) (magna cum laude)
2012-16 Birla Institute of Technology and Science B.E (Hons.) Computer Science (undergraduate thesis advisor: Nutan Limaye, IIT Bombay). My undergraduate thesis was titled Circuit Complexity and Parallel Algorithms and is available on this link.
2020 Bounded Reachability is Decidable in FIFO Machines (MOVEP 2020, CONCUR 2020)
2018 Verification of Flat Population Protocols (LSV Talk, Cachan, France)
2015 Timelapse of AS-level topology graphs using BGP advertisements. (COMSNETS 2015)
2021 B. Bollig, C. Di Guisto, A. Finkel, L. Laversa, E. Lozes and A. Suresh. A Universal Framework for Deciding Synchronizability. In Proceedings of the 32nd International Conference on Concurrency Theory (CONCUR’21),Paris, France, August 2021.
2020 B. Bollig, A. Finkel, and A. Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR’20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
2019 A. Suresh. Termination, boundedness and reachability for input-bounded FIFO Machines. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
2016 S. Puthanveetil, M. Cho, A. Suresh. Estimation of the parameters of solar cells from current-voltage characteristics using genetic algorithm. International Journal on Soft Computing, Artificial Intelligence and Applications, February 2016.
- Git / Mercurial
Areas of interest
- Formal methods
- Automata Theory
- Complexity Theory
- Graph Algorithms
My personal github account hosts my hobby development projects.
Co-author of the Best Paper Award winning submission at CONCUR ‘20.
One in 22 worldwide to be awarded the Digicosme scholarship for Master’s students in Computer Science in 2018.
One in 4 to receive the INRIA - ENS Paris Saclay scholarship in 2017.
Ranked in All India top 1 percent for Senior Secondary Examinations 2012 and All India Engineering Entrance Examinations 2012.
2018 Technical University of Munich (Munich, Germany) Worked in the group of Prof. Javier Esparza. Addressed the problem of automatic verification of population protocols, and extended the subclass of population protocols which can be automatically verified, using ideas from Petri Nets and infinite state systems. Worked on enhancing the performance of the tool PEREGRINE.
2015 Intuit India Development Centre (Small Business Group) (Bangalore, India) Helped the migration of QuickBooks accounts to Amazon Web Services, and the integration of SalesForce DotCom.
2014 Indian Space Research Organization (Satellite Centre) (Bangalore, India) Worked for the summer on the estimation of the parameters of solar cells from current-voltage characteristics using genetic algorithm. Also set up an online tool for the analysis of solar cell performance for the Power Systems Group.
2016-2017 Intuit, Inc. Software Engineer (QuickBooks Online and Intuit Online Payroll)
Available on request.