RAPL

Rutgers Architecture and Programming Languages Research Group

CoRE 333, Department of Computer Science, Rutgers University

News

• (New) February 2024: Our paper conditionally accepted to PLDI 2024!
• (New) February 2024: Paper on memory safety to appear in IEEE Security and Privacy's 2024 special issue!
• June 2023: Awarded a NSF SHF Small Grant for the project on building solvers for low dimensional linear programs solvers.
• June 2023: Intel Corporation supports our work on the RLIBM project with another unrestricted research gift. Thanks Intel!
• April 2023: Our paper "Verifying the verifier: eBPF Range Analysis Verification" accepted for publication at CAV 2023. Congratulations Hari, Matan, and Srinivas!
• February 2023: New fast implementations of trigonometric functions from the RLIBM project now available.
• November 2022: Our paper on Fast Polynomial Evaluation in the RLIBM project accepted for publication at CGO 2023!
• November 2022: The RLIBM project now provides fast and correctly rounded trigonometric functions. Congrats Sehyeok Park on this excellent work!
• October 2022: Santosh Nagarakatte's talk at the 2022 Papers We Love Conference on the RLIBM project is now available.
• September 2022: Our paper "Fast Shadow Execution for Debugging Numerical Errors using Error Free Transformations" accepted to OOPSLA 2022!
• August 2022 2022: Intel Corporation supports our research on the RLIBM project with a research gift. Thanks Intel.
• July 2022: Mohammadreza Soltaniyeh and Sangeeta Chowdhary successfully defend their PhD dissertations. Congratulations Reza and Sangeeta!
• June 2022: Jay Lim's dissertation awarded the 2022 ACM SIGPLAN John C Reynolds Outstanding Dissertation Award! Congratulations Jay!
• May 2022: ACM SIGPLAN blog post about our paper recognized with the POPL 2022 Distinguished Paper Award is live now.
• April 2022: Our paper on a hardware accelerator for convolutional networks accepted to ACM TACO-2022. Congratulations Reza!
• April 2022: CGO 2022 Distinguished Paper Award for our paper on verifying tnum operations with colleague Srinivas Narayana and PhD students Harishankar Vishwanathan and Matan Shachnai!
• February 2022: Our new result in the RLIBM project accepted for publication at PLDI 2022!
• December 2021: Our RLIBM-ALL paper recognized with the ACM SIGPLAN POPL 2022 Distinguished Paper Award. See the POPL program here. Congratulations Jay!
• December 2021: Correctly rounded logf from our RLIBM project now in LLVM's libc. See here.
• December 2021: Camera ready for our CGO 2022 paper sent to the publisher. Our new algorithm for tnum multiplication is now part of the Linux Kernel. Read here.
• December 2021: Reza's paper on accelerating recommendation systems with SmartSSDs accepted to SPEC ICPE 2022. Congratulations Reza!
• September 2021: Our new result on producing a single polynomial approximation that generates correct results for multiple representations and rounding modes accepted to POPL-2022. See the technical report here. Congratulations Jay!
• September 2021: Jay Lim successfully defends this PhD thesis . Jay Lim joins Yale University's Computer Science department as a lecturer. Congratulations Dr. Jay P. Lim!
• August 2021: See our ACM SIGPLAN blog post on the RLIBM project that was recognized with the PLDI 2021 Distinguished Paper Award.
• June 2021: Our Linux kernel patch with a new algorithm for sound and precise multiplication of tnums (an abstract domain in the eBPF verifier) has been upstreamed. Congratulations Hari and Matan!
• May 2021: PLDI 2021 Distinguished Paper Award for our paper: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations. Congratulations Jay!
• May 2021: Our paper on parallel shadow execution for debugging floating point errors accepted to FSE 2021. Congratulations Sangeeta!
• May 2021: Santosh Nagarakatte and Mridul Aanjaneya awarded NSF SHF Grant for the project "Techniques for Generating Correctly Rounded Math Libraries".
• April 2021: Our paper "High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations" accepted to PLDI 2021. Congratulations Jay!
• January 2021: Nader Boushehrinejad Moradi successfully defends his PhD disseration. Congratulations Nader! He joins University of Utah as a post-doc.
• October 2020: Our novel approach for generating math libraries accepted to POPL 2021. Congratulations Jay!
• August 2020: Srinivas Narayana and Santosh Nagarakatte awarded NSF Formal Methods in the Field Track I grant for the project "Formally Verified Sandboxing for Packet-Processing Programs".
• June 2020: Nader's paper on detecting races in OpenMP programs using the OpenMP Series Parallel Graph accepted for publication at IWOMP 2020. Congratulations Nader!
• April 2020: Approximating Trigonometric Functions for Posits using the CORDIC Method camera ready sent to CF 2020.
• April 2020: Debugging and Detecting Numerical Errors in Computation with Posits camera ready sent to PLDI 2020.
• March 2020: Jay and Matan's paper "Approximating Trigonometric Functions for Posits Using the CORDIC Method" accepted for publication at Computing Frontiers 2020. Congratulations Jay and Matan!
• Feb 2020: Sangeeta and Jay's paper "Debugging and Detecting Numerical Errors in Computation with Posits" conditionally accepted to PLDI 2020. Congratulations Sangeeta and Jay!
• October 2019: Srinivas Narayana and Santosh awarded Facebook Networking Systems Research Award for their project on ebpf verification.
• September 2019: Adarsh Yoga successfully defended his PhD dissertation. Congrats Dr. Adarsh Yoga!
• July 2019: Santosh awarded NSF FMiTF Grant for the research on equivalence checking for cryptography libraries.
• June 2019: Santosh receives the NSF SHF grant for the project on Posits.
• June 2019: Sangeeta Chowdhary wins Bronze Medal at PLDI 2019 Student Research Competition. Congratulations Sangeeta!
• February 2019: Adarsh's paper on what-if and differential performance analyses conditionally accepted for publication at PLDI 2019. Congrats Adarsh! Adarsh is on the academic job market. Hire him.
• October 2018: Jay's paper on equivalence checking for implementations of crypto algorithms accepted for publication at CGO 2019. Congratulations Jay!
• August 2018: Nader and Adarsh's paper on a novel OpenMP profiler accepted for publication at SC 2018! Congratulations Nader and Adarsh!
• July 2018: David Menendez's dissertation selected to receive the ACM SIGPLAN John C. Reynolds Dissertation Award! Congratulations David!.
• June 2018: Jay Lim wins Gold Medal in the graduate category at PLDI 2018 SRC. Congrats Jay!
• April 2018: Attend TaskProf tutorial at PLDI 2018, Philadelphia, USA on June 18, 2018.
• Feb 2018: Our Communications of the ACM Research Highlights Article is now available here.
• December 2017: David Menendez successfully defended his PhD dissertation. Congrats David!

• Jay's paper on reasoning about retrofitting transformations accepted for publication at the PLAS 2017 workshop. Congrats Jay!
• David's ICSE 2016 paper "Termination-Checking for LLVM Peephole Optimizations" selected as Computing Review's one of the Notable Articles and Books of 2016. See more information here. Congrats David!
• Adarsh's paper "A Fast Causal Profiler for Task Parallel Programs" accepted for publication at FSE 2017! Congrats Adarsh! See TR version here.
• Our paper "Provably Correct Peephole Optimizations with Alive" selected as CACM Research Highlights Paper!
• David's paper "Precondition Inference for Peephole Optimizations in LLVM" accepted for publication at PLDI 2017! Congrats David! See TR version here.
• Jay is joining Microsoft Research at Redmond for a summer internship on the CheckedC project under Dr. David Tarditi's supervision.
• PLDI 2015 paper "Provably Correct Peephole Optimizations with Alive" selected as SIGPLAN Research Highlights Paper. Congrats David!
• Adarsh's paper "Parallel Data Race Detection for Task Parallel Programs with Locks" accepted for publication at FSE 2016. Congrats Adarsh!
• David's paper "Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM" accepted for publication at SAS 2016. Congrats David!
• Adarsh's paper "Parallel Data Race Detection for Task Parallel Programs with Locks" conditionally accepted for publication at FSE 2016. Congrats Adarsh!
• ACM SIGSOFT ICSE 2016 Distinguished Paper Award for "Termination-Checking for LLVM Peephole Optimizations". Congrats David!
• David's paper on termination checking for LLVM peephole optimizations accepted for publication at ICSE 2016. Congrats David!
• Adarsh's paper on atomicity checking for task parallel program accepted to CGO 2016. Congrats Adarsh!
• Santosh awarded Intel Corporation Gift for the project "Lightweight Formal Methods for LLVM Verification".
• RAPL at PLDI 2015: Distinguished Paper Award, David with his poster, Adarsh with his poster
• Adarsh wins the third prize in the PLDI 2015 Student Research Competition in the graduate student category!
• ACM SIGPLAN Distinguished Paper Award for the Alive paper at PLDI 2015!
• Adarsh's poster on atomicity checking for task based programs to appear at PLDI SRC 2015
• "Everything You Want to Know about Pointer-based Checking" accepted to SNAPL 2015.
• Santosh received the NSF CAREER Award for "Semantics, Abstractions, and Tools for a Pragmatic Verified LLVM Compiler"!
• ApproxHadoop paper accepted for publication at ASPLOS 2015.
• Santosh received Intel Corporation gift for research on memory safety!
• Santosh received the NSF STARSS grant with Vinod Ganapathy and Liviu Iftode for research on hardware methods for OS integrity!
• Santosh received the Google Faculty Research Award for Semi-automatic verification of LLVM Optimizations!

Members

• Santosh Nagarakatte  (faculty)
• Matan Shachnai (PhD student)
• Sehyeok Park (PhD student)
• Harishankar Vishwanathan (PhD student, co-supervised with Prof. Srinivas Narayana)
• Alborz Jelvani (PhD student, co-supervised with Prof. Rich Martin)

Former members

• Sangeeta Chowdhary (PhD 2022). Dissertation: Fast Methods to Detect and Debug Numerical Errors with Shadow Execution.
• Mohammadreza Soltaniyeh(PhD 2022). Dissertation: Hardware-Software Techniques for Accelerating Sparse Computation.
• Jay P. Lim (PhD 2021). Dissertation: Novel Polynomial Approximation Methods for Generating Correctly Rounded Elementary Functions
• Nader Boushehrinejadmoradi   (PhD 2021). Dissertation: Performance Profilers and Debugging Tools for OpenMP Applications
• Adarsh Yoga  (PhD 2019). Dissertation: Parallelism-Driven Performance Analysis Techniques for Task Parallel Programs
• David Menendez   (PhD 2018). Dissertation: Practical Formal Techniques and Tools for Developing LLVM's Peephole Optimizations
• Josh Cooper, Sammy Berger(Undergrad, NSF REU 2020)
• Mihai Andrei, Adity Shastri, Steven Hsu (Undergrad, Aresty)
• Sangini Shah (BSMS student)
• Oliver Katz  (Undergrad student)
• Shreyas Hirday  (Undergrad, Aresty Summer Science Program)
• Cedric Abano, Gordon Chu, Gabriel Eisemen, Justin Fu, Tiffany Yu (High School Outreach, NJ Governor's School Program)

Publications

• Verifying the Verifier: eBPF Range Analysis Verification. [preprint]
  Harishankar Vishwanathan, Matan Shachnai, Srinivas Narayana, and Santosh Nagarakatte
  (To appear) 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)
  
  
• Fast Methods to Detect and Debug Numerical Errors with Shadow Execution [pdf]
  Sangeeta Chowdhary's PhD dissertation supervised by Prof. Santosh Nagarakatte
  Department of Computer Science, Rutgers University, October 2022
  
  
• Hardware-Software Techniques for Accelerating Sparse Computation [pdf]
  Mohammadreza Soltaniyeh's PhD dissertation supervised by Prof. Santosh Nagarakatte
  Department of Computer Science, Rutgers University, October 2022
  
  
• 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 Langauge 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® [preprint]
  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
  
  
• 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
  
  
• Novel Polynomial Approximation Methods for Generating Correctly Rounded Elementary Functions [pdf]
  Jay Lim's PhD dissertation supervised by Prof. Santosh Nagarakatte
  Department of Computer Science, Rutgers University, September 2021
  
  
• 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
  
  
• 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
  
  
• Performance Profilers and Debugging Tools for OpenMP Applications [pdf]
  Nader Boushehrinejad Moradi's PhD dissertation supervised by Prof. Santosh Nagarakatte
  Department of Computer Science, Rutgers University, January 2021
  
  
• 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-driven Performance Analysis Techniques for Task Parallel Programs [pdf]
  Adarsh Yoga's PhD dissertation supervised by Prof. Santosh Nagarakatte
  Department of Computer Science, Rutgers University, October 2019
  
  
• Parallelism-centric What-If and Differential Analyses [pdf]
  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).
  
  
• 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
  
  
• Practical Formal Techniques and Tools for Developing LLVM's Peephole Optimizations [pdf]
  David Menendez's PhD dissertation supervised by Prof. Santosh Nagarakatte
  ACM SIGPLAN John C. Reynolds Dissertation Award 2018
  Department of Computer Science, Rutgers University, January 2018
  
  
• 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
   
• 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)
   
• 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)
   
• Everything You Want to Know about Pointer-Based Checking[pdf]
  Santosh Nagarakatte, Milo M K Martin and Steve Zdancewic
  Proceedings of SNAPL: The Inaguaral 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)
   

Support

Our research group is supported by gifts and grants from the Intel Corporation, Google Inc, Facebook, and the National Science Foundation: NSF SHF Grant 2021, NSF FMITF Track I grant, NSF FMiTF Track II grant, NSF SHF Grant, NSF CAREER Award, NSF-STARSS Grant, and NSF-TC Sub-award

Old Group Photos