Education

• Ph.D., Computer Science (2000-2005)
  University of California at Berkeley
  Advisor: Prof. George Necula
  


• B.Tech, Computer Science and Engineering (1996-2000)
  Indian Institute of Technology (IIT), Kanpur, India
  GPA: 4.00
  

Awards

• IIT Kanpur West Coast Alumni Leadership Award, 2008. (In recognition of his leadership as a young alumni and for contributions to research excellence).


• ACM SIGPLAN Outstanding Doctoral Dissertation Award, 2005.


• C.V. Ramamoorthy Distinguished Research Award for outstanding contributions to a new research area in computer science, 2005.


• Microsoft Research Fellowship for graduate studies, 2004-05.


• UC Regents Fellowship for graduate studies, 2000-01.


• President's Gold Medal award for best academic performance in the graduating class in all disciplines of the undergraduate programmes at IIT Kanpur, May 2000.


• Proficiency award for best project (final year thesis) in Computer Science and Engineering discipline at IIT Kanpur, May 2000.


• Dr. V. Rajaraman Scholarship for excellent academic performance at IIT Kanpur, 1999-00.


• Hughes Software Systems Best Student award (at national level), 1998.


• Qualified for Singapore Airlines Fellowship (SIA-NOL Scholarship) for undergraduate studies in Nanyang Technological University, Singapore (1995).


• City Montessori School Best Student award (among more than 1000 students), 1995.


• National Talent Search Scholarship awarded by the government of India, 1993-2000.

Publications

Referred Journal Publications

• A polynomial-time algorithm for global value numbering. Sumit Gulwani and George Necula, To appear in SAS 2004 special issue of Science of Computer Programming , Elsevier.


• A randomized satisfiability procedure for arithmetic and uninterpreted functions. Sumit Gulwani and George Necula, In CADE (Conference on Automated Deduction) 2003 special issue of Information and Computation , Elsevier.

Referred Conference Publications

• Lifting Abstract Interpreters to Quantified Logical Domains. Sumit Gulwani and Bill McCloskey and Ashish Tiwari, In the 35th Annual ACM Symposium on Principles of Programming Languages (POPL), 2008.


• An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software. Sumit Gulwani and Ashish Tiwari, In Computer Aided Verification (CAV), 2007.


• Computing Procedure Summaries for Interprocedural Analysis. Sumit Gulwani and Ashish Tiwari, In European Symposium on Programming (ESOP), 2007.


• Assertion Checking Unified. Sumit Gulwani and Ashish Tiwari, In the 8th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), 2007.


• Program Verification as Probabilistic Inference. Sumit Gulwani and Nebojsa Jojic, In the 34th Annual ACM Symposium on Principles of Programming Languages (POPL), 2007


• Combining Abstract Interpreters. Sumit Gulwani and Ashish Tiwari, In ACM Conference on Programming Language Design and Implementation (PLDI), July 2006.


• Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions. Sumit Gulwani and Ashish Tiwari, In 15th European Symposium on Programming (ESOP), March 2006.


• Precise interprocedural analysis using random interpretation. Sumit Gulwani and George Necula, In 32nd ACM Symposium on Principles of Programming Languages (POPL) , Jan. 2005.


• Global value numbering using random interpretation. Sumit Gulwani and George Necula, In 31st ACM Symposium on Principles of Programming Languages (POPL) , pages 342--352, Jan. 2004.


• Discovering affine equalities using random interpretation. Sumit Gulwani and George Necula, In 30th ACM Symposium on Principles of Programming Languages (POPL) , pages 74--84, Jan. 2003.


• A polynomial-time algorithm for global value numbering. Sumit Gulwani and George Necula, In 11th Static Analysis Symposium (SAS) , volume 3148 of LNCS , Springer, 2004. Extended version to appear in the journal Science of Computer Programming, Elsevier.


• Path-sensitive analysis for linear arithmetic and uninterpreted functions. Sumit Gulwani and George Necula, In 11th Static Analysis Symposium (SAS) , volume 3148 of LNCS , Springer, 2004.


• Join algorithms for the theory of uninterpreted functions. Sumit Gulwani, Ashish Tiwari and George Necula, In 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) , volume 3328 of LNCS , Springer, 2004.


• A randomized satisfiability procedure for arithmetic and uninterpreted functions. Sumit Gulwani and George Necula, In 19th International Conference on Automated Deduction (CADE) , volume 2741 of LNCS , Springer, 2003. Extended version appears in journal of Information and Computation, Elsevier.


• WebCaL: a domain specific language for web caching. Sumit Gulwani, Asha Tarachandani, Deepak Gupta, Dheeraj Sanghi, Luciano Barreto, Gilles Muller and Charles Consel, In 5th International Web caching and Content Delivery Workshop, May 2000. Also appears in volume 24 of Computer Communications, Feb 2001.

Unrefereed Publications

• Generating random spanning trees. Sourav Chatterji and Sumit Gulwani, Graduate course project report for Markov Chains Monte Carlo (cs294-4), UC-Berkeley, Dec 2002. [Survey+Suggestions]


• Platform independent checkpointing of the execution of a C-program Sumit Gulwani and Asha Tarachandani, Graduate course project report for Advanced Topics in Operating Systems (cs262A), UC-Berkeley, Dec 2000. [Research]


• Set-constraint based program analysis. Sumit Gulwani, Graduate course project report for Design and Analysis of Programming Languages (cs263), UC-Berkeley, Dec 2000. [Survey]


• WebCaL: a domain specific language for web caching. Sumit Gulwani and Asha Tarachandani, Undergraduate thesis, IIT Kanpur, April 2000. [Research]


• Security issues in multimedia. Sumit Gulwani, Graduate course project report for Topics in Multimedia (cs726), IIT Kanpur, April 2000. [Survey]


• Issues in designing the next generation transport protocol. Sumit Gulwani, Graduate course project report for Topics in Networking (cs725), IIT Kanpur, April 1999. [Survey+Suggestions]


• Programming languages for high performance computing. Sumit Gulwani and Asha Tarachandani, Graduate course project report for Advanced Compiler Optimizations (cs738), IIT Kanpur, Dec 1999. [Survey]

Professional Activities

• PC Participation: CC 2008


• Reviewed papers for conferences: SAS 2006, CAV 2006, PLDI 2006, POPL 2005, VMCAI 2005, FSTTCS 2004


• Teaching assistant for upper-division course ``Programming Languages and Compilers'' (cs164), UC-Berkeley, Spring 2003.


• Member of graduate admissions committee, computer science division, UC-Berkeley, 2004.


• Conference talks given at: ESOP 2006, POPL 2005, FSTTCS 2004, POPL 2004, SAS 2004, POPL 2003, CADE 2003

Invited Talks

• Random Interpretation. Job-interview talk given at computer science departments of several graduate schools: CMU, Cornell, Caltech, UIUC, UPenn, UW-Madison, UMich-Ann Arbor, UC-San Diego, UMass-Amherst, Purdue, and NYU, Feb-May 2005.


• Random Interpretation. In Stanford Software Seminar at Stanford University, Nov 16, 2004.


• Random interpretation. In UW/MSR summer institute on Trends in Testing: Theory, Techniques and Tools, Aug 24, 2004.


• Randomized join algorithms for linear arithmetic and uninterpreted functions. In summer school on Combination of Decision Procedures organized by Stanford Univ., Aug 12, 2004.


• Random Interpretation. In Logic seminar at SRI International, Menlo Park, June 3, 2004.


• Random Interpretation. Microsoft Research, Redmond (WA), Feb 11, 2004.


• Random interpretation. In graduate class on Topics in Program Analysis at University of California at Davis, April 30, 2003.


• Join algorithms: theorem proving meets program analysis. In Mini-Workshop on Automated Deduction: Formal Digital Libraries and Little Engines of Proof organized by SRI International, Menlo Park (CA), Oct 27, 2003.


• Translation validation using randomization. In Computer Science and Engineering seminar, IIT Kanpur (India), Jan 11, 2002.

Internships

• Microsoft Research (Redmond) Sep-Oct, 2004
  Mentor: Madan Musuvathi and Tom Ball
  Project: Combination of cover algorithms.
  


• Microsoft Design and Development (Redmond), Jun-Aug 2001
  Project: Translation validation for Visual C++ compiler using random interpretation.
  


• IRISA-INRIA labs (Rennes, France), Jun-Aug, 1999
  Mentor: Gilles Muller and Charles Consel
  Project: Design and development of a domain specific language for web caching.
  

References