Jul 2013 – May 2014 · 10 mos

• Worked as a TA for Computer Architecture and Implementation of Programming Languages courses.
• Duties included conducting labs and help sessions for students, grading assignments and exams and help the professor in conducting the course.

Jul 2012 – May 2013 · 10 mos

• Involved communicating with different companies as well as universities and assisting them in their process of recruitment of students for internships.
• Involved the scheduling of the different companies for their internship recruitment process.

Jul 2012 – May 2013 · 10 mos

• Involved guiding the 2nd Year as well as 3rd Year department students in academic problems.
• Involved suggesting reforms and improvements in the academic curriculum of the department.

May 2013 – Jul 2013 · 2 mos · Bangalore

• Designed a source language independent algorithm for pointer analysis in a language named Boogie
• Formulated the problem using the allocation site abstraction and inferred results using a tool named Houdini
• Implemented the algorithm in C# and verified its soundness experimentally
• Demonstrated improved precision in some cases over the existing Anderson’s algorithm for pointer analysis

May 2012 – Jul 2012 · 2 mos · Kaiserslautern, Germany

• Worked jointly under Prof. Roland Meyer (Head of the Concurrency Theory Group at TU Kaiserslautern) and Prof. Rupak Majumdar (Managing Director, Max-Planck Institute for Software Systems)
• Formulated definitions for Linearizability of concurrent programs under weak memory models, namely, the Total Store Ordering (TSO) and Partial Store Ordering (PSO) memory models.
• Further worked on the problem of decidability of Linearizability under the TSO model.