Santosh Nagarakatte
where else to find them
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2025
- POPL2 editions2021–2022
all 5 in the filters
on a stage with
all 10 in the filters
who talks about the same things
- Jay P. Lim2 talks
- Mridul Aanjaneya2 talks
- Ariel E. Kellison5 talks
- Boguslaw Cyganek5 talks
- Tobias Grosser14 talks
- Gilbert Louis Bernstein9 talks
| title | conference | date |
|---|---|---|
| Exploring Locally Bounded Translation Validation | SOAP 2026 | 2026-06-16 |
Extends Alive2 to accept local unroll bounds and formalizes locally bounded program pairs as a lattice, then uses random sampling with a search-and-prune… | ||
| Comparing the Precision of Abstract Operators in the eBPF Verifier using Differential(…) | SAS 2025 | 2025-10-13 |
Presents a reproducible pipeline that lifts the 30,000-line eBPF verifier C code (about 6,000 lines of abstract-operator logic) into SMT via LLVM, checks… | ||
| From Formal Verification to Correctly Rounded Math Libraries | PLMW @ PLDI 2025 | 2025-06-16 |
Describes concrete claims and tools: a 64-bit key lock-and-key scheme plus four metadata fields per pointer to enforce spatial and temporal memory safety; an… | ||
| Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode | PLDI 2025 | 2025-06-16 |
RLibm generates correctly rounded elementary functions and this work builds two ways to avoid costly rounding-mode switches: round-to-zero emulation replaces… | ||
| Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear(…) | PLDI 2024 | 2024-06-24 |
Claims an algorithm that finds a maximum consensus floating point solution for infeasible low-dimensional linear programs with billions of constraints and few… | ||
| One Polynomial Approximation to Produce Correctly Rounded Results of an Elementa | POPL 2022 | 2022-01-16 |
Claims a single polynomial, found by solving linear programs over rounding intervals, yields correctly rounded elementary-function results across multiple… | ||
| Generating Correctly Rounded Math Libraries for New Floating Point Variants | POPL 2021 | 2021-01-17 |
Generates polynomials that approximate the correctly rounded value (not the real value) and encodes coefficient constraints as an LP-formulated constraints… | ||
| nothing matches | ||