The Team

Systems Excellence, Industry Execution

Teyon is led by systems researchers who has spent nearly two decades on deterministic replay, memory analysis, and automatic failure diagnosis, and who has run large-scale ML training in production.

Research

A decade of systems research, now in production

Teyon's engines come from peer-reviewed work on deterministic replay, memory analysis, and automatic failure diagnosis at SOSP, PLDI, OOPSLA, ICSE, CCS, and USENIX Security.

Papers

8 published · 1 in progress

Selected papers; the original PDF available for download in the detail pages.

OOPSLA '232023

MemPerf: Profiling Allocator-Induced Performance Slowdowns

The first profiler that tells you when the memory allocator, not your code, is what slows a program down.

Read the summary
ISMM '232023

NUMAlloc: A Faster NUMA Memory Allocator

A drop-in allocator built for NUMA machines: 15.7% faster than mimalloc and 20.9% faster than glibc, scaling to 128 threads.

Read the summary
OOPSLA '202020

Watcher: In-Situ Failure Diagnosis

Pinpoints the root cause of a crash inside the failing process, in seconds, without a memory dump ever leaving the machine.

Read the summary
PLDI '182018

iReplayer: In-Situ and Identical Record-and-Replay for Multithreaded Applications

Records multithreaded programs at about 3% overhead and replays them identically inside the original process.

Read the summary
USENIX Security '182018

Guarder: A Tunable Secure Allocator

A secure allocator with stable, tunable randomization entropy at under 3% overhead.

Read the summary
CCS '172017

FreeGuard: A Faster Secure Heap Allocator

A secure heap allocator that defends against overflows, use-after-frees, and double frees at under 2% overhead.

Read the summary
ICSE '162016

DoubleTake: Fast and Precise Error Detection via Evidence-Based Dynamic Analysis

Finds buffer overflows, use-after-frees, and leaks at under 5% overhead by checking for evidence at epoch ends and replaying only when something went wrong.

Read the summary
SOSP '112011

Dthreads: Efficient Deterministic Multithreading

Makes unmodified C/C++ multithreaded programs deterministic, often at the speed of pthreads.

Read the summary
In progress2026

MemScope

Ongoing work on CPU and GPU memory analysis, the research basis of XScope.

Patents

12 granted · 24 provisional

Granted US patents naming Tongping Liu as inventor, assigned to the universities and companies where the work was done. A further 24 provisional patents are on file, 14 of them owned by Teyon; provisional filings are not public, so only granted patents are listed.

  1. US 12,541,443Classification of Different Types of Cache MissesUniversity of Massachusetts Amherst · 2026
  2. US 12,314,761Memory Allocation and Management in Non-Uniform Memory Access (NUMA) Computing EnvironmentsUniversity of Massachusetts Amherst · 2025
  3. US 11,599,445Watcher: Precise and Fully-Automatic On-Site Failure DiagnosisUniversity of Texas System · 2023
  4. US 11,593,483Guarder: An Efficient Heap Allocator with Strongest and Tunable SecurityUniversity of Texas System · 2023
  5. US 11,294,652Low-Overhead Detection Techniques for Synchronization Problems in Parallel and Concurrent SoftwareUniversity of Texas System · 2022
  6. US 10,915,424Defeating Deadlocks in Production SoftwareUniversity of Texas System · 2021
  7. US 10,901,828FreeGuard: A Faster Secure Heap AllocatorUniversity of Texas System · 2021
  8. US 10,474,369Mapping Guest Pages to Disk Blocks to Improve Virtual Machine Management ProcessesVMware · 2019
  9. US 10,394,714System and Method for False Sharing PredictionFuturewei Technologies · 2019
  10. US 9,678,883System and Method for Detecting False SharingFuturewei Technologies · 2017
  11. US 9,547,599System and Method for Predicting False SharingFuturewei Technologies · 2017
  12. US 8,868,849Coupled Lock Allocation and Lookup for Shared Data Synchronization in Symmetric Multithreading EnvironmentsSamsung Electronics · 2014

Ready for resilient AI infrastructure?

Stop losing $10K+ per GPU failure. Let's talk.