Mukund Raghothaman

Department of Computer and Information Science
University of Pennsylvania
3330 Walnut St GRW 571
Philadelphia, PA 19104


Research Interests

Formal verification and program synthesis. Automata theory and model checking.


In Submission

  1. Rajeev Alur, Adam Freilich, and Mukund Raghothaman. Regular combinators for string transformations, 2014. [Short version], [Full version].
  2. Rajeev Alur, Milo Martin, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, and Abhishek Udupa. Synthesizing finite-state protocols from scenarios and requirements, 2014. [Paper].


  1. Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo Martin, Mukund Raghothaman, Sanjit Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. Syntax-guided synthesis. In Formal Methods in Computer-Aided Design (FMCAD), 2013, pages 1--17, 2013. [Paper].
  2. Rajeev Alur, Loris D’Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, and Yifei Yuan. Regular functions and cost register automata. Symposium on Logic in Computer Science, pages 13--22, 2013. [Paper], [Full version].
  3. Rajeev Alur and Mukund Raghothaman. Decision problems for additive regular functions. In Fedor Fomin, Rūsiņš Freivalds, Marta Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming, volume 7966 of Lecture Notes in Computer Science, pages 37--48. Springer, 2013. [Paper], [Full version], [Slides].
  4. Mukund Raghothaman. Learning techniques in verification and model checking. Written Preliminary Exam - 2. 2012. [Paper], [Slides].


While in college, I was involved with the IITG amateur astronomy club. While I barely know my way around the night sky without a sky chart (thanks to having grown up in a city), I did help with organizing some competitions — mostly with framing (hopefully interesting) questions. Here are two problem sets, from 2009, and from 2010. There was also a “design” competition in 2010, with a more open-ended task.