Santosh Nagarakatte

Orcid: 0000-0002-5048-8548

According to our database1, Santosh Nagarakatte authored at least 50 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Report of the DOE/NSF Workshop on Correctness in Scientific Computing, June 2023, Orlando, FL.
CoRR, 2023

Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach.
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, 2023

Verifying the Verifier: eBPF Range Analysis Verification.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
An Accelerator for Sparse Convolutional Neural Networks Leveraging Systolic General Matrix-matrix Multiplication.
ACM Trans. Archit. Code Optim., 2022

One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes.
Proc. ACM Program. Lang., 2022

Fast shadow execution for debugging numerical errors using error free transformations.
Proc. ACM Program. Lang., 2022

Near-Storage Processing for Solid State Drive Based Recommendation Inference with SmartSSDs®.
Proceedings of the ICPE '22: ACM/SPEC International Conference on Performance Engineering, Bejing, China, April 9, 2022

Progressive polynomial approximations for fast correctly rounded math libraries.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Sound, Precise, and Fast Abstract Interpretation with Tristate Numbers.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2022

2021
An approach to generate correctly rounded math libraries for new floating point variants.
Proc. ACM Program. Lang., 2021

RLibm-Prog: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries.
CoRR, 2021

RLIBM-ALL: A Novel Polynomial Approximation Method to Produce Correctly Rounded Results for Multiple Representations and Rounding Modes.
CoRR, 2021

SPOTS: An Accelerator for Sparse CNNs Leveraging General Matrix-Matrix Multiplication.
CoRR, 2021

Semantics, Verification, and Efficient Implementations for Tristate Numbers.
CoRR, 2021

RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations.
CoRR, 2021

Parallel shadow execution to accelerate the debugging of numerical errors.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

High performance correctly rounded math libraries for 32-bit floating point representations.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Near-Storage Acceleration of Database Query Processing with SmartSSDs.
Proceedings of the 29th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2021

2020
A Novel Approach to Generate Correctly Rounded Math Libraries for New Floating Point Representations.
CoRR, 2020

Synergistic CPU-FPGA Acceleration of Sparse Linear Algebra.
CoRR, 2020

Debugging and detecting numerical errors in computation with posits.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

On-the-fly Data Race Detection with the Enhanced OpenMP Series-Parallel Graph.
Proceedings of the OpenMP: Portable Multi-Level Parallelism on Modern Systems, 2020

Approximating trigonometric functions for posits using the CORDIC method.
Proceedings of the 17th ACM International Conference on Computing Frontiers, 2020

2019
Parallelism-centric what-if and differential analyses.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Automatic Equivalence Checking for Assembly Implementations of Cryptography Libraries.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2019

2018
Practical verification of peephole optimizations with Alive.
Commun. ACM, 2018

A parallelism profiler with what-if analyses for OpenMP programs.
Proceedings of the International Conference for High Performance Computing, 2018

2017
A fast causal profiler for task parallel programs.
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, 2017

Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Compiler Optimizations with Retrofitting Transformations: Is there a Semantic Mismatch?
Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security, 2017

2016
Precondition Inference for Peephole Optimizations in LLVM.
CoRR, 2016

Parallel data race detection for task parallel programs with locks.
Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2016

Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Termination-checking for LLVM peephole optimizations.
Proceedings of the 38th International Conference on Software Engineering, 2016

Atomicity violation checker for task parallel programs.
Proceedings of the 2016 International Symposium on Code Generation and Optimization, 2016

2015
Everything You Want to Know About Pointer-Based Checking.
Proceedings of the 1st Summit on Advances in Programming Languages, 2015

Provably correct peephole optimizations with alive.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Testing Cross-Platform Mobile App Development Frameworks (T).
Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering, 2015

ApproxHadoop: Bringing Approximations to MapReduce Frameworks.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking.
Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013
Hardware-Enforced Comprehensive Memory Safety.
IEEE Micro, 2013

Formal verification of SSA-based optimizations for LLVM.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Ironclad C++: a library-augmented type-safe subset of c++.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, 2013

2012
Formalizing the LLVM intermediate representation for verified program transformations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Multicore acceleration of priority-based schedulers for concurrency bug detection.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Watchdog: Hardware for safe and secure manual memory management and full memory safety.
Proceedings of the 39th International Symposium on Computer Architecture (ISCA 2012), 2012

2010
iCFP: Tolerating All-Level Cache Misses in In-Order Processors.
IEEE Micro, 2010

CETS: compiler enforced temporal safety for C.
Proceedings of the 9th International Symposium on Memory Management, 2010

A randomized scheduler with probabilistic guarantees of finding bugs.
Proceedings of the 15th International Conference on Architectural Support for Programming Languages and Operating Systems, 2010

2009
SoftBound: highly compatible and complete spatial memory safety for c.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009


  Loading...