Santosh Nagarakatte
PhD Student
Architecture and Compilers Group,
Computer and Information Science,
University of Pennsylvania
 
email santoshn at figure out the domain name
office 001-267-254-4521
address 614, Levine Hall, 3330 Walnut Street,
  Philadelphia, PA 19104

About me
 I am a first second third year PhD student in the Computer and Information Sciences department at the University of Pennsylvania. I am advised by Milo Martin.
I interned at Microsoft Research with Madan Musuvathi and Sebastian Burckhardt from June-September 2009.

Collaborators
 Sebastian Burckhardt, R Govindarajan, Andrew Hilton,Pravesh Kothari, Milo Martin, Madanlal Musuvathi, Amir Roth , Steve Zdancewic , Jianzhou Zhao.

Research Interests
 Broadly architecture and compilers. Specifically, architectural and runtime support for security, hardware and language support for concurrency.

CV(last updated: March 2009)
Current Projects
SoftBound is a technique to provide spatial safety guarantees for the C programming language. Download
iCFP is a micro-architecture technique to make in-order processors, cache miss tolerant at all levels

Publications

Peer reviewed
  • A Randomized Scheduler with Probabilistic Guarantees of Finding Concurrency Bugs [pdf]
    (Alphabetical order) Sebastian Burckhardt, Pravesh Kothari, Madanlal Musuvathi, and Santosh Nagarakatte
    Proceedings of International Conference on Architectural Support for Programming Languages & Operating Systems (ASPLOS 2010)
    March, 2010 (To appear)
     
  • iCFP: Tolerating All-Level Cache Misses in In-Order Processors [pdf]
    Andrew Hilton, Santosh Nagarakatte, and Amir Roth
    IEEE MICRO's "Top Picks of Architecture Conferences of 2009" Issue(Micro Top Picks'10)
    January-February 2010 (To appear)
     
  • SoftBound: Highly Compatible and Complete Spatial Memory Safety for C [pdf]
    Santosh Nagarakatte, Jianzhou Zhao, Milo M K Martin, Steve Zdancewic
    In the Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), June 2009
    Acceptance Rate: 21% (41 out of 196 submissions)
     
  • iCFP: Tolerating All-Level Cache Misses in In-Order Processors [pdf]
    Andrew Hilton, Santosh Nagarakatte, Amir Roth
    Proceedings of the 15th International Symposium on High Performance Computer Architecture (HPCA), Feb 2009
    Acceptance Rate: 19% (35 out of 184 submissions)
     
  • Register Allocation and Optimal Spill Code Scheduling in SWP loops
    Santosh Nagarakatte, R. Govindarajan
    Proceedings of the 16th International Conference on Compiler Construction (CC), March 2007
    Acceptance Rate: 23% (14 out of 60 submissions)
Reports
  • SoftBound: Highly Compatible and Complete Spatial Memory Safety for C [pdf]
    Santosh Nagarakatte, Jianzhou Zhao, Milo M K Martin, Steve Zdancewic
    University of Pennsylvania Technical Report MS-CIS-09-01, January 2009
     

Teaching

I was the TA for CIS 371 in Spring 2009 and CIS 501 in Fall 2008.

Biography

I obtained my B.E in Computer Engg. and M.S(Engg) from the National Institute of Technology, Karnataka, Surathkal (NITK/KREC) and the Indian Institute of Science, Bangalore respectively.

Awards and Honors

  • Paper in IEEE Micro's Top Picks Issue 2010
  • University Gold Medal by NITK Surathkal for the excellent academic performance in Computer Engineering for the period 2001-2005
  • Philips Research Fellowship by Philips and IISc for the period 2005-2007
  • University of Pennsylvania Graduate Fellowship

    • Talks

  • SoftBound: Highly Compatible and Complete Spatial Memory Safety for C at LLVM Developer's Meeting, Cupertino, CA, October 2009 [video]
  • A Randomized Scheduler for Finding Concurrency Bugs at Microsoft Research, Redmond, September 2009
  • SoftBound: Highly Compatible and Complete Spatial Memory Safety for C at PLDI, Dublin, Ireland, June 2009
  • Register Allocation and Optimal Spill Code Scheduling at CC 2007, Braga, Portugal, March 2007

    • Course work

  • CIS 500, Software Foundations (Fall 2007)
  • CIS 501, Computer Architecture (Fall 2007)
  • CIS 670, Program Analysis (Fall 2007)
  • CIS 502, Analysis of Algorithms (Spring 2008)
  • CIS 505, Software Systems (Spring 2008)
  • CIS 640, Introduction to Multiprocessor Programming (Spring 2009)
    • website hit counters
    website hit counter