• Matan Shachnai (Ph.D student, advising since Fall 2020): eBPF
• Papers: SAS-2024, CAV-2023, CGO-2022, Arxiv-2021
• Sehyeok Park (Ph.D student, advising since Fall 2021): Math libraries, Floating point
• Tung-Che Chang (Ph.D student, Fall 2024): Formal methods, verification
• Harishankar Vishwanathan (Ph.D student, co-advising with Srinivas Narayana since Spring 2021): eBPF
• Papers: SAS-2024, CAV-2023, CGO-2022, Arxiv-2021
• Alborz Jelvani (Ph.D Student, co-advising with Rich Martin since Fall 2022): Heterogeneous systems

• Graduated PhD students
  • Sangeeta Chowdhary, Ph.D 2022
    
    • Dissertation: Fast Methods to Detect and Debug Numerical Errors with Shadow Execution.
    • Papers: OOPSLA 2022, FSE 2021, PLDI 2020
    • PhD committee: Prof. Richard P Martin, Prof. Mridul Aanjaneya, Prof. Sreepathi Pai (University of Rochester)
    • Internships:
      • Microsoft Research Redmond under Dr. Srinath Setty's supervision, Summer 2019.
      • Microsoft Research Redmond under Dr. Kim Laine's supervision, Summer 2020.
    • Awards: Bronze Medal at PLDI 2019 SRC
    • First employment: AMD Research
  • Mohammadreza Soltaniyeh, Ph.D 2022
    
    • Dissertation: Hardware-Software Techniques for Accelerating Sparse Computation.
    • Papers: ACM TACO 2022, ICPE 2021,
    • PhD committee: Prof. Richard P Martin, Prof. Yipeng Huang, Prof. Joe Devietti (University of Pennsylvania)
    • Internships: Samsung FPGA Team
    • First employment: Samsung FPGA Team
  • Jay Lim, Ph.D 2021
    
    • Dissertation: Novel Polynomial Approximation Methods for Generating Correctly Rounded Elementary Functions.
    • Papers: PLDI 2022, POPL 2022, PLDI 2021, POPL 2021, PLDI 2020, CF 2020, CGO 2019, PLAS 2017
    • PhD committee: Prof. Uli Kremer, Prof. Richard Martin, Prof. Zachary Tatlock (University of Washington)
    • Internships: Microsoft Research Redmond under Dr. David Tarditi's supervision, summer 2017.
    • Awards:
      • 2022 ACM SIGPLAN John C Reynolds Outstanding Dissertation Award
      • POPL 2022 Distinguished Paper Award
      • PLDI 2021 Distinguished Paper Award
      • Rizvi Fellowship and Gold Medal at PLDI 2018 SRC
    • First employment: Lecturer at Yale University's Department of Computer Science
  • Nader Boushehrinejadmoradi, Ph.D 2021
    
    • Dissertation: Performance Profilers and Debugging Tools for OpenMP Applications
    • Papers: IWOMP-2020, SC 2018, ASE 2015
    • PhD committee: Prof. Badri Nath, Prof. Srinivas Narayana, Prof. Martha Kim (Columbia)
    • First employment: Post-doc at the University of Utah
  • Adarsh Yoga , Ph.D 2019
    
    • Dissertation: Parallelism-Driven Performance Analysis Techniques for Task Parallel Programs
    • Papers: PLDI 2019, SC 2018, FSE 2017, FSE 2016, CGO 2016
    • PhD committee: Prof. Uli Kremer, Prof. Sudarsun Kannan, Dr. Madanlal Musuvathi (Microsoft Research)
    • First employment: Intel Corporation
    • Internships:
      • HP Labs under Dr. Milind Chabbi's supervision, summer 2017
      • Intel Corporation under Dr. Harish Patil's supervision, summer 2014
    • Awards:
      • Bronze medal at PLDI 2015 SRC
  • David Menendez , PhD 2018
    
    • Dissertation: Practical Formal Techniques and Tools for Developing LLVM's Peephole Optimizations
      
    • Papers: PLDI 2017, ICSE 2016, SAS 2016, PLDI 2015
    • Awards:
      • 2018 ACM SIGPLAN John C. Reynolds Dissertation Award
      • Distinguished Paper Award at PLDI 2015
      • Distinguished Paper Award at ICSE 2016
      • ACM SIGPLAN Research Highlights Paper 2016
      • CACM Research Highlights Paper 2018
    • PhD committee: Prof. Rajeev Alur (University of Pennsylvania), Prof. Uli Kremer, Prof. Thu Nguyen
    • First employment: Assistant Teaching Professor at Rutgers University
• MS Students
  • Sangini Shah (BS/MS student, advising since Spring 2017): Programming Crypto code
  • Ashish Jindal (MS student, Spring 2017): Memory safety
• Undergrads
  • Ankush Gul Makhijani (undergrad, Summer 2024-): Correct Numerics
  • Hiya Mavani (undergrad, Summer 2024-): Verifying the eBPF Verifier
  • Bavi Tyagi (undergrad, Spring 2023-Spring 2024): Lattice-based Cryptography
  • Atanas Damianov (undergrad, Spring 2023-Spring 2024): Lattice-based Cryptography
  • Justin Kim (undergrad, NSF REU, Spring 2023-Spring 2024): Correctly Rounded Math Libraries with the RLIBM Approach
  • Saipranav Kalapala (undergrad, CS Honors thesis, Fall 2022-Spring 2023): Correctly Rounded Math Libraries with the RLIBM Approach
  • Anika Kumar (Project Super, Spring 2021): Project SUPER mentee on Floating Point and Posits
  • Shehneel Asharaf (Project Super, Spring 2021): Project SUPER mentee on Floating Point and Posits
  • Josh Cooper (undergrad, NSF REU Summer 2020): Static Analysis
  • Sammy Berger (undergrad, NSF REU Summer 2020): Static Analysis
  • Mihai Andrei (Undergrad, Aresty RA, Fall 2017-Spring 2018): Crypto Verification
  • Steven Hsu (Undergrad, Aresty RA, Fall 2017-Spring 2018): Crypto Verification
  • Aditya Shastri (Undergrad, Fall 2017-Spring 2018): Crypto Verification
  • Chun Lau (Undergrad, Jan 2017- April 2018): Verification
  • Lester Fan (Undergrad, Fall 2017): Verification
  • Oliver Katz (Undergrad, Jan 2016-May 2017): Aresty Research Assistant: SMT Solvers for Verification
  • Shreyas Hriday (May 2014-Aug 2014): Aresty Summer Science Student: App Testing
  • Mauricio Trajano (Fall 2014): Aresty Research Assistant: Memory Safety for C/C++
  • Matthew Tantoy (Aresty undergrad, Fall 2016): Invariants and SMT solvers
• High School Outreach
  • NJ Governor's school GSET students 2014: Cedric Abano, Gordon Chu, Gabriel Eisemen, Justin Fu, Tiffany Yu
    • "If You Think You Can Write Correct Programs, Think Again!" See video here.

• The 2024 eBPF Foundation research gift with colleague Srinivas Narayana for our project on verifying the eBPF verifier.
• 2024 Intel Corporation Research Gift for the RLIBM project.
• ACM Distinguished Member, 2023.
• Intel Corporation Research Gift for the RLIBM project.
• Adviser of Jay Lim's dissertation that was awarded the 2022 ACM SIGPLAN John C Reynolds Outstanding Dissertation Award.
• CGO 2022 Distinguished Paper Award.
• ACM SIGPLAN POPL 2022 Distinguished Paper Award.
• ACM SIGPLAN PLDI 2021 Distinguished Paper Award.
• Awarded Facebook Networking Systems Grant for ebpf verification with Srinivas Narayana. September 2019.
• Adviser of David Menendez's dissertation that was awarded the 2018 ACM SIGPLAN John C Reynolds Outstanding Dissertation Award.
• CACM Research Highlights Paper, 2018.
• Intel Corporation's unrestricted gift for the year 2017-2018.
• ACM SIGPLAN Research Highlights Paper, 2016
• Intel Corporation Gift for research on LLVM verification with Alive-NJ, 2016.
• ACM SIGSOFT ICSE 2016 Distinguished Paper Award
• Intel Corporation Gift for research on Lightweight Formal Methods for LLVM Verification, 2015
• ACM SIGPLAN PLDI 2015 Distinguished Paper Award
• NSF CAREER Award for the project: "Semantics, Abstractions, and Tools for a Pragmatic Verified LLVM Compiler". 2015-2019
• Intel Corporation Gift for the research on Memory Safety with SoftBoundCETS and Intel MPX , 2014
• Google Research Award 2014 for the project on verified compilers
• Paper in IEEE Micro's Top Picks Issue 2013
• 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 and Departmental Activities
  • Fall 2020- current: CS Undergraduate Program Director, Academic Integrity Facilitator (AIF), Faculty Mentor in the Rutgers Connection Network Mentoring Program, LSAMP program's faculty mentor, SAS Honors program faculty mentor, CS Honors chair.
  • Spring 2020: LAMPS alliance faculty mentor, CS honors chair, Exec committee, CS faculty hiring committee chair, School of Graduate Studies Academic Cluster committee.
  • 2019: CS honors chair, CS faculty hiring committee
• Program Committee
  • 2025: ASPLOS 2025, NDSS 2025, CGO 2025
  • 2024: ASPLOS 2024 (vice-chair), PLDI 2024, ESOP 2024, NSF Panel 2024 (2X), DOE Panel 2024, Associate Editor of TACO
  • 2023: ASPLOS 2023, ARITH 2023, POPL 2023, PPoPP 2023, NSF Panel 2023
  • 2022: ASPLOS 2022, PLDI 2022, CGO 2022, NSF Panel 2022
  • 2021: PriSc 2021, NSF Panel 2021, DOE Panel 2021
  • 2020: PLDI 2020, CC 2020
  • 2019: CGO 2019, NSF Panel 2019
  • 2018: POPL 2018, OOPSLA 2018, CC 2018 , PLDI 2018 SRC , NSF Panel 2018
  • 2017: CGO 2017, ICSE 2017 SRC, NSF Panel 2017, ISEC 2017, APLAS 2017
  • 2016: PLDI 2016 , NSF Panel 2016, ISEC 2016,
  • 2015: PLDI 2015 , NSF Panel 2015, APLAS 2015 , FCS 2015 , ISEC 2015
  • 2014: PERTEA 2014 , OOPSLA 2014 , WODET 2014 , ASPLOS 2014
  • 2013: WODA 2013
• External Review Committee:
  • PLDI 2019, ASPLOS 2019 , ASPLOS 2018, PLDI 2017, POPL 2017, PPOPP 2014
• Organization
  • Program Vice-chair: ASPLOS 2024
  • SIGPLAN Track Chair: PLDI 2022
  • General Chair: VEE 2020
  • Steering Committee: PriSC
  • Sponsorship Chair: PLDI 2015, PLDI 2014
  • Program Co-chair: WODA 2014

• Spring 2024: 01:198:211 Computer Architecture
• Fall 2022: 01:198:211 Computer Architecture
• Spring 2022: 16:198:546 Computer Security
• Fall 2020: 01:198:211 Computer Architecture
• Spring 2020: 16:198:544 Computer Security
• Fall 2019: 01:198:211 Computer Architecture
• Spring 2019: 16:198:544 Computer Security
• Fall 2018: 01:198:211 Computer Architecture
• Spring 2018: 16:198:516 Programming Languages and Compilers II
• Fall 2017: 01:198:211: Computer Architecture
• Spring 2017: 01:198:211: Computer Architecture
• Fall 2016: 16:198:515: Programming Languages and Compilers I
• Fall 2015: 01:198:211: Computer Architecture
• Spring 2015: 01:198:211: Computer Architecture
• Fall 2014: 16:198:515 Programming Languages and Compilers I
• Spring 2014: 16:198:516 Programming Languages and Compilers II ("Hack your own language")
• Fall 2013: 01:198:211: Computer Architecture
• Summer 2013: Robust Software with Verified Programming at IIT Hyderabad
• Spring 2013: 16:198:671: Performance aware Reliable Software for Multicore Processors

• RLIBM:Efficient and Correct Math Libraries
  • Papers: PLDI 2024, CGO 2023, PLDI 2022 POPL 2022, PLDI 2021, POPL 2021, PLDI 2020 , CF 2020
  • Prototype :
    • The RLIBM Project Github
    .
    • RLIBM-ALL: One Polynomial Approximation for Multiple Representations and Rounding Modes
    • RLibm-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations.
    • RLibm: Correctly Rounded Math Libraries for Bfloat16 and Posit16
    • RLibm Generator: A Math Library Generator for Correctly Rounded Math Libraries for Bfloat16 and Posit16
• Verified eBPF Ecosystem
  • Papers: SAS 2024, CAV 2023, CGO 2022
  • Prototypes and Linux Kernel Patches :
    • Agni Prototype for verifying eBPF verifier's range analysis
    • Our tnum abstract multiplication now integrated into the eBPF verifier in the Linux Kernel
    • Our patch to fix latent unsoundness in the abstract operators of the eBPF verifier in the Linux Kernel
• Lightweight Formal Methods for LLVM verification
  • Papers: CACM-RH 2018 , PLDI 2017, SAS 2016, ICSE 2016, PLDI 2015
  • Prototype :
    • Alive-Infer: Data driven precondition inference for LLVM optimizations
    • Alive-NJ with support for for Integer and FP optimizations
    • Alive cycle detection
    • Alive github
• Parallel Programming, Testing, and Debugging
  • Papers: IWOMP-2020 , PLDI 2019, SC 2018, FSE 2017, FSE 2016, CGO 2016, PLDI 2012, ASPLOS 2010
  • Students: Adarsh Yoga, Nader Boushehirnejadmoradi
  • Prototype:
    • A Parallelism Profiler and an Adviser with What-if and Differential Analyses
    • TaskProf: A Fast Causal Profiler for Task Parallel Programs
    • PTRacer: Parallel data race detector for task parallel programs
    • Atomicity checker for Intel TBB programs
• Equivalence Checking for Crypto Libraries
  • Papers : CASM-Verify at CGO 2019
  • Source code : CASM-Verify GitHub
• Programming abstractions and Reasoning for Posits
  • Papers : PositDebug and FPSanitizer at PLDI 2020, Rutgers DCS-TR-753, CF-2020
  • Source code : PositDebug GitHub, FPSanitizer , and CORDIC with Posits
• Programming FGAs
  • Papers: ACM TACO 2022, Rutgers DCS-TR-750

• Memory safety for C and C++
  • Papers: SNAPL 2015, CGO 2014, OOPLSA 2013, TopPicks 2013, ISCA 2012, ISMM 2010, PLDI 2009
  • Prototype: Experimental SoftBoundCETS for LLVM-3.8.0, SoftBoundCETS for LLVM-3.4 from github, SoftBoundCETS webpage
• Verified LLVM Compiler
  • Papers: POPL 2012, PLDI 2013
  • Prototype: Download Vellvm for LLVM-3.0
• ApproxHadoop
  • Papers : ASPLOS 2015

• Inorder Continual Flow Pipeline
  • Papers: HPCA 2009, TopPicks 2010

• Fixing Latent Unsound Abstract Operators in the eBPF Verifier of the Linux Kernel. [preprint]
  Matan Shachnai, Harishankar Vishwanathan, Srinivas Narayana, and Santosh Nagarakatte.
  Proceedings of the 31st Static Analysis Symposium (SAS 2024), Pasadena, California, USA, October 2024.
  
  
• Full Spatial and Temporal Memory Safety for C. [preprint]
  Santosh Nagarakatte
  IEEE Security and Privacy's Special Issue on Memory Safety, August 2024. 10 pages.
  
  
• Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation. [pdf]
  Mridul Aanjaneya and Santosh Nagarakatte
  Proceedings of the ACM Programming Languages (PACMPL), Programming Language Design and Implementation (PLDI-2024) issue, Copenhagen, Denmark, June 24-28, 2024. 26 pages.
  Acceptance rate: 28% (89 out of 316 submissions)
  
  
• Verifying the Verifier: eBPF Range Analysis Verification. [preprint]
  Harishankar Vishwanathan, Matan Shachnai, Srinivas Narayana, and Santosh Nagarakatte
  Proceedings of the 35th International Conference on Computer Aided Verification (CAV-2023), Paris, France, July 17-22, 2023.
  Acceptance rate: 26% (68 out of 262 submissions)
  
  
• Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach. [preprint]
  Mridul Aanjaneya and Santosh Nagarakatte
  Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization (CGO-2023), Montreal, Canada, Feb 25- March 1st, 2023.
  Acceptance rate: 39% (20 out of 51 submissions)
  
  
• Fast Shadow Execution for Debugging Numerical Errors using Error Free Transformations. [preprint]
  Sangeeta Chowdhary and Santosh Nagarakatte
  Proceedings of the ACM Programming Languages (PACMPL), Object-Oriented Programming, Systems and Applications (OOPSLA-2022) issue, Auckland, New Zealand, December 5-10, 2022. 28 pages.
  Acceptance rate: 31% (92 out of 294 submissions)
  
  
• An Accelerator for Sparse Convolutional Neural Networks Leveraging Systolic General Matrix-Matrix Multiplication [preprint]
  Mohammed Reza Soltaniyeh, Richard P. Martin, and Santosh Nagarakatte
  Proceedings of the ACM Transactions on Architecture and Code Optimization (ACM TACO-2022), 2022. 25 pages
  
  
• Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries [preprint]
  Mridul Aanjaneya, Jay P. Lim, and Santosh Nagarakatte
  Proceedings of the 2022 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-2022), San Diego, USA, June, 2022.
  Acceptance rate: 21% (68 out of 326 submissions)
  
  
• Sound, Precise, and Fast Abstract Interpretation with Tristate Numbers [preprint]
  Harishankar Vishwanathan, Matan Shachnai, Srinivas Narayana, and Santosh Nagarakatte
  Proceedings of the International Symposium on Code Generation and Optimization (CGO-2022), Seoul, South Korea, April, 2022.
  Acceptance rate: 27% (27 out of 99 submissions)
  CGO 2022 Distinguished Paper Award
  
  
• Near-Storage Processing for Solid State Drive Based Recommendation Inference with SmartSSDs® [paper]
  Mohammadreza Soltaniyeh, Veronica Lagrange Moutinho Dos Reis, Matt Bryson, Xuebin Yao, Richard Martin and Santosh Nagarakatte
  Proceedings of the 13th ACM/SPEC International Conference on Performance Engineering (ICPE-2022), Beijing, China, April, 2022.
  
  
• One Polynomial Approximation to Produce Correctly Rounded Results of an Elementary Function for Multiple Representations and Rounding Modes [preprint]
  Jay Lim and Santosh Nagarakatte
  Proceedings of the 49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL-2022), Philadelphia, USA, January 16-22, 2022.
  Acceptance rate: 23% (65 out of 286 submissions)
  ACM SIGPLAN POPL 2022 Distinguished Paper Award
  
  
• Parallel Shadow Execution to Accelerate the Debugging of Numerical Errors [preprint]
  Sangeeta Chowdhary and Santosh Nagarakatte
  Proceedings of the ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE-2021), Athens, Greece, August 23-28, 2021.
  Acceptance rate: 24% (97 out of 396 submissions)
  
  
• High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations [preprint]
  Jay P Lim and Santosh Nagarakatte
  Proceedings of the 2021 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-2021), June 20-25, 2021.
  Acceptance rate: 27% (87 out of 320 submissions)
  ACM SIGPLAN PLDI 2021 Distinguished Paper Award
  
  
• An Approach to Generate Correctly Rounded Math Libraries for New Floating Point Variants [preprint]
  Jay P Lim, Mridul Aanjaneya, John Gustafson, and Santosh Nagarakatte
  Proceedings of the 2021 ACM SIGPLAN Symposium on Principles of Programming Languages (POPL-2021), Jan 17-22, 2021.
  Acceptance Rate: 23% (61 out of 258 submissions).
  
  
• On-the-fly Data Race Detection with the Enhanced OpenMP Series-Parallel Graph [pdf]
  Nader Boushehrinejadmoradi, Adarsh Yoga, and Santosh Nagarakatte
  Proceedings of the 16th International Workshop on OpenMP (IWOMP-2020), Austin, Texas, September 21-24, 2020.
  
  
• Debugging and Detecting Numerical Errors in Computation with Posits [preprint]
  Sangeeta Chowdhary, Jay P Lim, and Santosh Nagarakatte
  Proceedings of the 2020 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-2020), London, United Kingdom, June 15-20, 2020.
  Acceptance Rate: 22% (77 out of 341 submissions).
  
  
• Approximating Trigonometric Functions for Posits Using the CORDIC Method [preprint]
  Jay P. Lim, Matan Shachnai, and Santosh Nagarakatte
  Proceedings of the ACM International Conference on Computing Frontiers (CF-2020), Sicily, Italy, May 11-13, 2020.
  Acceptance Rate: 32% (24 out of 75 submissions).
  
  
• Parallelism-centric What-If and Differential Analyses [preprint]
  Adarsh Yoga and Santosh Nagarakatte
  Proceedings of the 2019 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-2019), Phoenix, Arizona, United States, June 22-26, 2019.
  Acceptance Rate: 27% (76 out of 274 submissions).
  
  
• Automatic Equivalence Checking for Assembly Implementations of Cryptography Libraries [pdf]
  Jay P Lim and Santosh Nagarakatte
  Proceedings of the International Symposium on Code Generation and Optimization (CGO-2019), Washington DC, USA, February 16-19, 2019.
  Acceptance Rate: 31% (21 out of 67 submissions).
  
  
• A Parallelism Profiler with What-If Analyses for OpenMP Programs [pdf] [online]
  Nader Boushehrinejad Moradi, Adarsh Yoga, and Santosh Nagarakatte
  Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018, Dallas, TX, USA, November 11-16, 2018. IEEE / ACM 2018.
  Acceptance Rate: 19% (55 out of 288 submissions).
  
  
• Practical Verification of Peephole Optimizations with Alive [pdf] [online]
  Nuno Lopes, David Menendez, Santosh Nagarakatte, and John Regehr
  Communications of the ACM Research Highlights (CACM-RH), Volume 61, Issue 2 , Pages 84-91, February 2018
  Technical Perspective: Building Bug-Free Compilers by Steve Zdancewic
  
  
• Compiler Optimizations with Retrofitting Transformations: Is there a Semantic Mismatch?[pdf]
  Jay P Lim, Vinod Ganapathy, and Santosh Nagarakatte
  Proceedings of the ACM SIGSAC Workshop on Programming Languages and Analysis for Security (PLAS 2017), Dallas, Texas, October, 2017
  
  
• A Fast Causal Profiler for Task Parallel Programs [pdf]
  Adarsh Yoga and Santosh Nagarakatte
  Proceedings of the 11th Joint Meeting of the European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 2017), Paderborn, September, 2017
  Acceptance rate: 24% (72 out of 295 submissions)
   
• ALIVE-INFER: Data Driven Precondition Inference for Peephole Optimizations in LLVM [pdf]
  David Menendez and Santosh Nagarakatte
  Proceedings of the 2017 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2017), Barcelona, June , 2017
  Acceptance rate: 15% (47 out of 322 submissions)
   
• Parallel Data Race Detection for Task Parallel Programs with Locks [pdf]
  Adarsh Yoga, Santosh Nagarakatte, and Aarti Gupta
  Proceedings of the 24th International Symposium on the Foundations of Software Engineering (FSE 2016), Seattle, November, 2016
  Acceptance rate: 27% (74 out of 273 submissions)
   
• Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM [pdf]
  David Menendez, Santosh Nagarakatte, and Aarti Gupta
  Proceedings of the 23rd Static Analysis Symposium (SAS 2016), Edinburgh, September, 2016
  Acceptance rate: 38% (21 out of 55 submissions)
   
• Termination-Checking for LLVM Peephole Optimizations [pdf]
  David Menendez and Santosh Nagarakatte
  Proceedings of the 38th International Conference on Software Engineering (ICSE 2016), May, 2016
  Acceptance rate: 19% (101 out of 530 submissions)
  ACM SIGSOFT Distinguished Paper Award
   
• Atomicity Checking for Task Parallel Programs[pdf]
  Adarsh Yoga and Santosh Nagarakatte
  Proceedings of the 2016 International Conference on Code Generation and Optimization (CGO-2016), March, 2016
  Acceptance rate: 23% (25 out of 108 submissions)
   
• Testing Native Cross-Platform Mobile App Development Frameworks[pdf]
  Nader Boushehrinejadmoradi, Vinod Ganapathy, Santosh Nagarakatte, and Liviu Iftode
  Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering (ASE-2015), November 2015
  Acceptance Rate: 20% (60 out of 289 submissions)
   
• Provably Correct Peephole Optimizations with Alive [pdf]
  Nuno Lopes, David Menendez, Santosh Nagarakatte, and John Regehr
  Proceedings of the 36th annual ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI-2015), June 2015
  Acceptance Rate: 19% (58 out of 303 submissions)
  ACM SIGPLAN Distinguished Paper Award
  SIGPLAN Research Highlights Paper
  CACM Research Highlights Paper
   
• Everything You Want to Know about Pointer-Based Checking[pdf]
  Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
  Proceedings of SNAPL: The Inaugural Summit On Advances in Programming Languages ( SNAPL 2015), May 2015
   
• ApproxHadoop: Bringing Approximations to MapReduce Frameworks [pdf]
  Inigo Goiri, Ricardo Bianchini, Santosh Nagarakatte, and Thu Nguyen
  Proceedings of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-2015), March 2015
  Acceptance Rate: 17% (48 out of 278 submissions)
   
• WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking [pdf]
  Santosh Nagarakatte, Milo M.K. Martin and Steve Zdancewic
  Proceedings of the 2014 International Symposium on Code Generation and Optimization (CGO-2014), February 2014
  Acceptance Rate: 28% (29 out of 103 submissions)
   
• Ironclad C++: A Library-Augmented Type-Safe Subset of C++ [pdf]
  Christian Delozier, Richard Eisenberg, Santosh Nagarakatte, Peter-Michael Osera, Milo M.K. Martin and Steve Zdancewic
  Proceedings of the 28th ACM Conference on Object-Oriented Programming, Systems and Applications (OOPSLA), October 2013
  Acceptance Rate: 26% (50 out of 189 submissions)
   
• Hardware-enforced Comprehensive Memory Safety [pdf]
  Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
  IEEE MICRO's "Top Picks of Architecture Conferences of 2012" Issue(Micro Top Picks'2013) May/June 2013
   
• Formal Verification of SSA Optimizations [pdf]
  Jianzhou Zhao, Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
  Proceedings of the 2013 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2013), June 2013
  Acceptance Rate: 17% (46 out of 267 submissions)
   
• Multicore Acceleration for Priority Based Schedulers for Concurrency Bug Detection[ACM version] [ pdf][pptm or pdf ]
  Santosh Nagarakatte, Sebastian Burckhardt, Milo M K Martin, Madan Musuvathi
  Proceedings of the 2012 ACM SIGPLAN Conference on Programming Language Design and Implementation ( PLDI 2012), June 2012
  Acceptance Rate: 19% (48 out of 255 submissions)
   
• Watchdog: Hardware for Safe and Secure Manual Memory Management and Full Memory Safety[pdf]
  Santosh Nagarakatte, Milo M K Martin, Steve Zdancewic
  Proceedings of the 39th International Symposium on Computer Architecture( ISCA 2012), June 2012
  Acceptance Rate: 18% (47 out of 262 submissions)
  IEEE MICRO Top Picks Paper  
  
  
• Formalizing the LLVM Intermediate Representation for Verified Program Transformations [pdf]
  Jianzhou Zhao, Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
  Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages( POPL 2012), January, 2012
  Acceptance Rate: 21% (44 out of 205 submissions)
   
• CETS: Compiler Enforced Temporal Safety for C [pdf]
  Santosh Nagarakatte, Jianzhou Zhao, Milo M K Martin and Steve Zdancewic
  Proceedings of International Conference on Memory Management (ISMM 2010), June, 2010
  Acceptance Rate: 43% (13 out of 30 submissions)
   
• A Randomized Scheduler with Probabilistic Guarantees of Finding Concurrency Bugs [pdf]
  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
  Acceptance Rate: 17% (32 out of 181 submissions)
   
• 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
   
• 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)
  IEEE MICRO Top Picks Paper
   
• 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)

• Practical Low-Overhead Enforcement of Memory Safety for C Programs[pdf]
  PhD Dissertation, University of Pennsylvania, November 2012
   

• Concurrency Software Testing with Probabilistic Bounds on Finding Bugs [pdf]
  Sebastian Burckhardt, Pravesh Kothari, Madanlal Musuvathi and Santosh Ganapati Nagarakatte
  US Patent : 8930907, Filing Date: December 1, 2009, Application number: 12/628,223, Publication date: 01/06/2015.

• RLibm-Prog: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries. [pdf]
  Mridul Aanjaneya, Jay P Lim and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-758, November 2021
  
  
• RLIBM-ALL: A Novel Polynomial Approximation Method to Produce Correctly Rounded Results for Multiple Representations and Rounding Modes [pdf]
  Jay P Lim and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-757, August 2021
  
  
• SPOTS: An Accelerator for Sparse CNNs Leveraging General Matrix-Matrix Multiplication [pdf]
  Mohammedreza Soltaniyeh, Richard P Martin, and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-756, July 2021
  
  
• Semantics, Verification, and Efficient Implementations for Tristate Numbers [pdf]
  Harishankar Vishwanathan, Matan Shachnai, Srinivas Narayana, and Santosh Nagarakatte
  Department of Computer Science, Rutgers University Technical Report DCS-TR-755, May 2021
  
  
• RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations [pdf]
  Jay P Lim and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-754, April 2021
  Extended version of our PLDI 2021 paper.
   
• A Novel Approach to Generate Correctly Rounded Math Libraries for New Floating Point Representations [pdf]
  Jay P Lim, Mridul Aanjaneya, John Gustafson, and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-753, July 2020
   
• Synergistic CPU-FPGA Acceleration of Sparse Linear Algebra [pdf]
  Mohammadreza Soltaniyeh, and Richard P. Martin, and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-750, April 2020
   
• A Fast Causal Profiler for Task Parallel Programs [pdf]
  Adarsh Yoga and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-728, May 2017
   
• Precondition Inference for Peephole Optimizations in LLVM [pdf]
  David Menendez and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-727, November 2016
   
• Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM [pdf]
  David Menendez, Santosh Nagarakatte, and Aarti Gupta
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-723, April 2016
   
• Termination Checking for LLVM Peephole Optimizations[pdf]
  David Menendez and Santosh Nagarakatte
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-718, August 2015
   
• ApproxHadoop: Bringing Approximations to MapReduce Frameworks[pdf]
  Inigo Goiri, Ricardo Bianchini, Santosh Nagarakatte, and Thu Nguyen
  Department of Computer Science, Rutgers University, Technical Report DCS-TR-709, August 2014
   
• Ironclad C++: A Library-Augmented Type-Safe Subset of C++ [pdf]
  Christian DeLozier, Richard Eisenberg, Santosh Nagarakatte, Peter-Michael Osera, Milo M. K. Martin and Steve Zdancewic
  University of Pennsylvania Technical Report MS-CIS-13-05, March 2013
   
• A Randomized Scheduler with Probabilistic Guarantees of Finding Bugs [pdf]
  Sebastian Burckhardt, Pravesh Kothari, Madanlal Musuvathi, Santosh Nagarakatte
  Microsoft Research Technical Report MSR-TR-2010-3, January 2010
   
• 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
   

• Intel Corporation Research Gift, PI, $62,000. Correctly Rounded Math Libraries with the RLIBM Approach. 2024-2025.
• The eBPF Foundation Research Gift, Co-PI, $50,000. Verified Path Exploration for eBPF Static Analysis.. 2024-2025.
• NSF, FMiTF Track II, Co-PI, $150,000, FMitF: Track II: Formally-Verified eBPF Verifier in the Linux Kernel, 2024-2026.
• NSF, PI, $19,991, DOE/NSF Workshop on Correctness in Scientific Computing, 2023.
• Intel Corporation Gift, PI, $62,000, A Case for Correctly Rounded Math Libraries with the RLIBM Approach. 2023-2024.
• NSF SHF Program-SHF, Co-PI, $540,000. "Efficient, Deterministic and Formally Certified Methods for Solving Low-dimensional Linear Programs with Floating-point Precision", 2023-2026.
• Intel Corporation Gift, PI, $62,000, A Case for Correctly Rounded Math Libraries with the RLIBM Approach. 2022-2023.
• NSF CORE Program-SHF, PI, $499,979, "Techniques for Generating Correctly Rounded Math Libraries", 2021-2024.
• NSF FMiTF Track I, Co-PI, $749,356, Formally Verified Sandboxing for Packet-Processing Programs , 2020-2024.
• Facebook Networking Systems Research Award, Co-PI, $50,000, Safe and Efficient Packet Processing with Verification of eBPF Programs, 2019.
• NSF FMiTF, PI, $99,996, "Automated Verification for Assembly Implementations of Cryptography Libraries", 2019-2021.
• NSF CORE Program-SHF, PI, $500,000, "Formalisms, Implementations, and Verification Procedures for Alternatives to Floating Point", 2019-2022.
• Intel Corporation Gift, PI, $75,000, Pragmatic abstractions, techniques, and tools for LLVM verification, 2017-2018.
• Intel Corporation Gift, PI, $75,000, Pragmatic abstractions, techniques, and tools for LLVM Verification with Alive-NJ, 2016.
• NSF TC, PI, $320,538, Sub-award of a NSF grant by the University of Pennsylvania: "WATCHDOG: Hardware-Assisted Prevention of All Use-After-Free Security Vulnerabilities", 2015-2017.
• Intel Corporation Gift, PI, $75,000, Lightweight Formal Methods for LLVM Verification, 2015.
• NSF CAREER Award, PI, $545,000, Semantics, Abstractions, and Tools for a Pragmatic Verified LLVM Compiler 2015-2019.
• NSF PLDI 2015 Travel Support, PI, $20000, Travel support for students to attend PLDI 2015.
• Intel Corporation Gift, PI, $70000, Memory Safety with SoftBoundCETS and Intel MPX, 2014.
• NSF STARSS, PI, $499998, Hardware Methods for OS Integrity, 2014-2017.
• Google Research Award, PI, $63500, Semi-Automatic Verification of LLVM optimizations with SMT solvers, 2014.
• NSF PLDI 2014 Travel Support, PI, $20000, Travel support for students to attend PLDI 2014.
• Rutgers Internal Council Grant, PI, $2000, Multithreaded Testing and Debugging Platform, 2013.

• Correctly Rounded Math Libraries in the Age of AI. Distinguished Webinar in AI/Cybersecurity. Department of Electrical Engineering and Computer Sciences at the University of North Dakota, August 2024.
• Correctly Rounded Math Libraries in the Age of AI. Invited talk at the National University of Singapore, August 14th, Singapore, August 2024.
• Correctly Rounded Math Libraries in the Age of AI. Invited talk at the Indian Institute of Technology, Delhi, August 5th, New Delhi, India, August 2024.
• Verifying the eBPF Verifier in the Linux Kernel, Invited talk at the Indian Institute of Science, Bangalore, August 8th, Bangalore, India, August 2024.
• Verifying the eBPF Verifier in the Linux Kernel, Invited talk at the Indian Institute of Technology, Dharwad, July 29th, Dhaward, India, July 2024.
• Correctly Rounded Math Libraries in the Age of AI. Invited talk at the LLVM-Social, Bangalore, July 13th, NVIDIA, Bangalore, July 2024.
• Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation. Conference talk at PLDI-2024, Copenhagen, Denmark, June 24-28, 2024.
• Correctly Rounded Math Libraries with the RLIBM Approach. Invited talk at the Berkeley Programming Systems Seminar, September, 2023.
• A Case for Correctly Rounded Math Libraries. Invited talk as part of the Silver Jubilee Lecture Series and Samvaad talk series at the Indian Institute of Information Technology, Bangalore (IIIT-B), Bangalore, India, March 2023.
• A Case for Correctly Rounded Math Libraries. Invited Talk at BITS-Goa, Goa, India, March 2023.
• A Case for Correctly Rounded Math Libraries. Invited Talk at the Indian Institute of Technology, Dharwad (IIT-Dh), Dharwad, India, March 2023.
• A Case for Correctly Rounded Math Libraries. Invited Talk at Microsoft Research India Lab, Bangalore, India, March 2023.
• A Case for Correctly Rounded Math Libraries. Invited Talk at the Indian Institute of Science, Bangalore, India, March 2023.
• A Case for Correctly Rounded Math Libraries. Invited Talk at the Two Sigma Academic Seminar Series, New York City, New York, November 2022.
• A Case for Correctly Rounded Math Libraries. Invited talk at the 2022 Papers We Love Conference, St Louis, Missouri, September 24, 2022.
• A Case for Correctly Rounded Elementary Functions. Rutgers CS Department Colloquium, Piscataway, NJ. September 2022.
• Correctly Rounded Elementary Functions with the RLIBM Approach. Invited talk at FP Talks 2022 virtual meeting. July 2022.
• A Case for Correctly Rounded Elementary Functions. Invited keynote talk at the New Jersey Programming Languages and Systems Seminar, Stevens University, Hoboken, NJ. May 2022.
• A Case for Correctly Rounded Elementary Functions. Keynote talk at the Conference on Next Generation Arithmetic 2022 as part of Supercomputing Asia. March 2022.
• Robust and Secure Computing Systems with Abstractions for Correctness and Performance. Invited talk and panelist at the 2021 NJ Cybersecurity Virtual Conference. October 2021.
• Programming, Debugging, and Reasoning Techniques for Posits. Invited talk at the University of Wisconsin-Madison Programming Languages Seminar Series. July, 2020.
• Programming, Debugging, and Reasoning Techniques for Posits. Invited talk at the Rutgers CS systems seminar. July, 2020.
• A Case for Parallelism Advisers and Profilers with What-If Analyses. Invited at the Workshop on Dependable and Secure Software Systems. ETH Zurich, October 18-19, 2019.
• A Case for Parallelism Profilers and Advisers with What-If Analyses. Invited talk at Parasol-II Workshop at Rutgers University, Piscataway, New Jersey, May 2019.
• A Case for Parallelism Profilers and Advisers with What-If Analyses. Guest talk at the 3rd Summit on Advances in Programming Languages (SNAPL-2019) at Brown University, Providence, Rhode Island, May 2019.
• Life After CIS PhD. Panelist at the Department of Computer and Information Sciences event. University of Pennsylvania, Philadelphia, PA, February 2019
• Compiler Optimizations and Retrofitting Transformations: Is there a Semantic Mismatch? Dagstuhl Seminar 18201 on Secure Compilation , Dagstuhl, Wadern, Germany, May 2018
• Debugging and Profiling Task Parallel Programs with TaskProf. Tutorial at PPoPP 2018, Vienna, Austria, February 2018
• Compiler Optimizations and Retrofitting Transformations: Is there a Semantic Mismatch? A short talk at Principles of Secure Compilation Workshop (PriSC 2018), Los Angeles, CA, January 2018
• Practical Formal Methods for Mainstream Compiler Developers, URCS Seminar, University of Rochester, Rochester, NY, October 2017
• A Fast Causal Profiler for Task Parallel Programs, UWPLSE Seminar, University of Washington, Seattle, October 2017
• Pragmatic Abstractions, Techniques, and Tools for LLVM Verification, Intel Corporation, September 2017
• Practical Formal Methods for Mainstream Compiler Developers, Invited talk, CS Department, Rutgers University, Piscataway, September 2017
• Practical Formal Methods for Mainstream LLVM Developers, Invited talk, TU Darmstadt, Darmstadt, Germany, September 2017
• Practical Formal Methods for Mainstream LLVM Developers, Invited talk, Max Planck Institute-Software Systems (MPI-SWS), Kaiserslautern, Germany, August 2017
• Alive-FP: Automated Verification of Floating Point Optimizations in LLVM, Invited talk, Dagstuhl Seminar 17352 – Analysis and Synthesis of Floating-point Programs, Dagstuhl, Wadern, Germany, August 2017
• Practical Formal Methods for Mainstream LLVM Developers, Invited talk, National Institute of Technology Karnataka (NITK), Surathkal, India, August 2017
• Data-driven Precondition Inference for Compiler Optimizations, Department Seminar, Department of Computer Science and Automation, Indian Institute of Science (IISc), Bangalore, India, August 2017
• Practical Formal Methods for Mainstream Developers, Department Seminar, Indian Institute of Technology Madras (IITM), Chennai, India, July 2017
• Practical Formal Methods for Mainstream Compiler Developers, Invited talks at Intel MRL Bangalore, India, July 2017
• Data Driven Precondition Inference for Compiler Optimizations, Microsoft Research India, Bangalore, India, July 2017
• Lightweight Formal Methods for LLVM Verification, MIT PL Seminar Series, MIT, Cambridge, MA, May 2017
• Lightweight Formal Methods for LLVM Verification, Invited Talk Series, CS department, SUNY Binghamton, NY, October 2016
• Pragmatic Abstractions, Techniques, and Tools for LLVM Verification, Intel Corporation, September 2016
• Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM, SAS 2016, Edinburgh, September 2016
• Lightweight Formal Methods for LLVM Verification, Indian Institute of Science, Bangalore, August 2016
• Lightweight Formal Methods for LLVM Verification, IIIT-Delhi, New Delhi, August 2016
• Lightweight Formal Methods for LLVM Verification, IIT-Delhi, New Delhi, August 2016
• Lightweight Formal Methods for LLVM Verification, TIFR, Mumbai, August 2016
• Lightweight Formal Methods for LLVM Verification, IIT Bombay, Mumbai, August 2016
• Lightweight Formal Methods for LLVM Verification, Microsoft Research India, Bangalore, July 2016
• Verifying Precise LLVM Floating Point Peephole Optimizations with Alive-FP, Deep Spec Workshop, Princeton University, June 2016
• Lightweight Formal Methods for Verifying High Performance Compilers, PL Seminar, Princeton University, April, 2016
• Lightweight Formal Methods for Verifying High Performance Compilers, School of Computer Science, Carnegie Mellon University, April, 2016
• Lightweight Formal Methods for Verifying High Performance Compilers, CS Department, University of California-Los Angeles, April, 2016
• Lightweight Formal Methods for Verifying High Performance Compilers, ECE Seminar Series, Purdue University, West Lafayette, March, 2016
• Lightweight Formal Methods for LLVM Verification, Programming Research Laboratory, Northeastern University, Boston, January 2016
• Lightweight Formal Methods for LLVM Verification, IBM PL Day, New York, November 2015
• Lightweight Formal Methods for LLVM Verification, Rutgers University, Piscataway, New Jersey, November 2015
• Lightweight Formal Methods for LLVM Verification, Constraints for Formal Verification Workshop, co-located with ICCAD 2015, Austin, Texas, November 2015
• Lightweight Formal Methods for LLVM Verification, Intel Corporation, Hillsboro, June 2015
• Pointer Checking with Intel MPX and SoftBoundCETS, Intel Corporation, Hillsboro, June 2015
• Everything You Want to Know About Pointer-Based Checking, SNAPL 2015, Asilomar, Monterey, May 2015
• Enablers and Roadblocks for Mainstream Adoption of Approximate Programming, Invited Panel Talk at the Second Workshop on Approximate Computing Across the System Stack, Istanbul, Turkey, March 2015
• Verified LLVM: Formal Semantics and Optimizations for LLVM in a Proof Assistant, Alcatel-Lucent Bell Labs, New Jersey, February 2014
• Complete and Verified Memory Safety with Pointer-based Checking and Verified LLVM, Computer Science Department, Stony Brook, New York, February 2014. [video1] [video2]
• WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking, CGO 2014, Orlando, February 2014
• Verified LLVM: Formal Semantics and Optimizations for LLVM in a Proof Assistant, IBM Research India, Bangalore, July 2013
• Formal Verification of SSA Optimizations for LLVM, PLDI 2013, Seattle, June 2013
• Verified LLVM: Formalizing the Semantics of the LLVM IR to Program Analysis Working Group, Microsoft Research Redmond, November 2012
• Verified LLVM: Formalizing the Semantics of the LLVM IR at LLVM Developer's Meeting, San Jose, November 2012 [video]
• Birds of a Feather Session on Memory Safety and Automated Defenses at LLVM Developer's Meeting, San Jose, November 2012
• Practical Low-overhead Enforcement of Memory Safety for C Programs, PhD Thesis Defense, University of Pennsylvania, October 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at the Indian Institute of Science, Bangalore, July 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Microsoft Research India, Bangalore, July 2012
• Multicore Acceleration of Priority-Based Schedulers for Concurrency Bug Detection at PLDI, Beijing, China, June 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Microsoft Research Redmond, Redmond, April 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Microsoft Research Silicon Valley, Mountain View, March 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Virginia Tech, ECE Department, Blacksburg, March 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Rutgers University, CS Department, New Brunswick, March 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at the University of Colorado Boulder, Boulder, March 2012
• Secure Low Level Programming with Hardware/Compiler Enforced Memory Safety at Virginia Tech, CS Department, Blacksburg, February 2012
• NeedlePoint: A Framework to Expose Concurrency Bugs by Controlling Thread Interleavings at the Indian Institute of Science (IISc), Bangalore, India, April 2011
• NeedlePoint: A Framework to Expose Concurrency Bugs by Controlling Thread Interleavings at Systems Lunch, Penn, Philadelphia, March 2011
• CETS: Compiler Enforced Temporal Safety for C at ISMM 2010, Toronto, June 2010
• SoftBound: Highly Compatible and Complete Spatial Memory Safety for C at Microsoft Research India, Bengaluru, December 2009
• 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

Activities

Charity