Mukund Raghothaman Contact Details Wednesday 8 October, 2014
Transcription
Mukund Raghothaman Contact Details Wednesday 8 October, 2014
Mukund Raghothaman Wednesday 8th October, 2014 Contact Details Department of Computer and Information Science University of Pennsylvania 3330 Walnut St GRW 571 Philadelphia, PA 19104 http://www.cis.upenn.edu/~rmukund/ rmukund@seas.upenn.edu Research Interests Formal verification and program synthesis. Automata theory and model checking. Education • 2010-Present, PhD candidate Advisor: Rajeev Alur Department of Computer and Information Science University of Pennsylvania • 2006-2010, Bachelor of Technology Computer Science and Engineering Indian Institute of Technology Guwahati Experience • June-August 2014, June-August 2013, Research Intern Advised by: Youssef Hamadi, Yi Wei Microsoft Research Ltd Cambridge, UK • May-July 2009, Software Development Engineer Intern Microsoft Corporation Redmond, WA Academics • Developed the stochastic SyGuS solver “stoch” which won second place of four particapting solvers in the inaugural Syntax-Guided Synthesis competition, 2014. • Teaching assistant for CIS 500, Software Foundations (Spring 2012). Helped with updating and creating new material, homework assignments and exams, and conducted office hours. 1 • Teaching assistant for CIS 262, Automata, Computability and Complexity (Fall 2011). Conducted office hours, prepared solutions to assignments and exams, and graded them. • Student representative in the CSE Department Undergraduate Programme Committee, 2008-2010 • Won an honourable mention at the ACM ICPC Asia Regionals, 2009 held at IIT Kanpur • Was awarded the National Talent Search Scholarship, 2004 by the National Council for Educational Research and Training Publications [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), pages 1–17, 2013. [2] Rajeev Alur, Loris D’Antoni, Jyotirmoy Deshmukh, Mukund Raghothaman, and Yifei Yuan. Regular functions and cost register automata. Symposium on Logic in Computer Science, pages 13–22, 2013. [3] Rajeev Alur and Mukund Raghothaman. Decision problems for additive regular functions. In Fedor Fomin, R¯ usi¸nš Freivalds, Marta Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming, volume 7966 of Lecture Notes in Computer Science, pages 37–48. Springer, 2013. [4] Rajeev Alur, Adam Freilich, and Mukund Raghothaman. Regular combinators for string transformations. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, pages 9:1–9:10. ACM, 2014. [5] Rajeev Alur, Milo Martin, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, and Abhishek Udupa. Synthesizing finite-state protocols from scenarios and requirements. In 10th International Haifa Verification Conference (HVC) (To appear), 2014. [6] Rajeev Alur, Loris D’Antoni, and Mukund Raghothaman. DReX: A declarative language for efficiently computable regular string transformations. In 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (To appear), 2015. Technical Reports [1] Mukund Raghothaman. Learning techniques in verification and model checking. Written Preliminary Exam - 2, Available at http://www.seas.upenn.edu/~rmukund/pdf/wpe2-paper.pdf, http: //www.seas.upenn.edu/~rmukund/pdf/wpe2-slides.pdf, 2012. [2] Mukund Raghothaman and Abhishek Udupa. Language to specify syntax-guided synthesis problems. CoRR, abs/1405.5590, 2014. Undergraduate Projects • Studied state reachability in counter automata (B. Tech Project with Dr. Purandar Bhaduri) • Worked on integrating a Microsoft-internal programming language, Scope into Visual Studio (Summer internship as a Software Development Engineer with the Bing Search Team, 2009) • Studied various models of real computation and presented a seminar on the undecidability of the Mandelbrot set (Undergraduate seminar with Dr. Pinaki Mitra) 2