I am a Ph.D. candidate at the Department of Computer Science & Engineering, University of California Riverside (UCR), advised by Manu Sridharan. My research is at the intersection of software engineering and programming languages. I wish to enhance programmer productivity through better programmer tools with improved security.
Currently, I am developing techniques to build sound and precise static call graphs for real-world JavaScript applications. My work addresses challenges posed by complex language features and varying root causes of call graph unsoundness. I have introduced indirection-bounded analysis to enhance call graph performance, with minimal reduction in recall and precision.
Interests: Software Engineering, Programming Languages, Developer Productivity.Indirection-Bounded Call Graph Analysis
M Chakraborty, A Gnanakumar, M Sridharan, and A Moller. In 38th European Conference on Object-Oriented Programming, (ECOOP 2024). [pdf]Automatic root cause quantification for missing edges in JavaScript call graphs
M Chakraborty, R Olivares, M Sridharan, and B Hassanshahi. In 36th European Conference on Object-Oriented Programming, (ECOOP 2022). [pdf]A study of Call Graph effectiveness for framework-based web applications
M Chakraborty. In Companion Proceedings of the 2021 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH Companion 2021). [pdf]