Publications

* denotes equal contribution.

ICML · 2026
SemRep: Generative Code Representation Learning with Code Transformations
Semantics-preserving code generation improves transformation correctness by 6.9% and performance by 1.1× with the same training budget.
paper
NeurIPS DL4C Workshop · 2025
DevBench: A Realistic, Developer-Informed Benchmark for Code Generation Models
A realistic, developer-informed benchmark for evaluating code generation models on tasks that reflect real-world software development.
paper
OOPSLA · 2024
Accurate Data Race Prediction in the Linux Kernel through Sparse Fourier Learning
Sparse Fourier learning predicts feasible kernel race traces, finding 44 more races and five new bugs.
paper code
FSE · 2024
Code-Aware Prompting: A study of Coverage Guided Test Generation in Regression Setting using LLM
Static-analysis-guided prompting that drives LLMs to reason symbolically about execution paths, doubling coverage of generated regression tests.
paper
Oakland S&P · 2023
Precise Detection of Kernel Data Races with Probabilistic Lockset Analysis
Probabilistic lockset analysis finds kernel races 3× faster, uncovering 183 races, including 102 harmful ones.
paper
ICSE · 2022 (ACM Sigsoft Distinguished Paper Award)
TOGA: A Neural Method for Test Oracle Generation
A neural transformer paired with a test-oracle grammar that automatically generates bug-finding assertions, with a 170% improvement in bug detection over prior systems.
paper code
OSDI · 2021 (OSDI Jay Lepreau Best Paper Award)
DistAI: Data-Driven Automated Invariant Learning for Distributed Protocols
Data-driven inference of inductive invariants for verifying safety properties of distributed protocols.
paper code
USENIX Security · 2021
Fine Grained Dataflow Tracking with Proximal Gradients
Proximal gradients improve dataflow-tracking F1 by 20% on average, finding 22 bugs with under 5% overhead.
paper code
PLDI · 2020
Learning Nonlinear Loop Invariants with Gated Continuous Logic Networks
Gated Continuous Logic Networks learn nonlinear loop invariants, solving 26 of 27 benchmarks, three more than prior work.
paper code
ICLR · 2020
CLN2INV: Learning Loop Invariants with Continuous Logic Networks
Continuous Logic Networks learn explicit SMT invariants, solving all 124 Code2Inv problems 40× faster than prior methods.
paper code
Infovis · 2018
At a Glance: Pixel Approximate Entropy as a Measure of Line Chart Complexity
Pixel Approximate Entropy predicts perceived line-chart complexity and the accuracy of at-a-glance judgments.
paper code
Oakland S&P Workshops · 2018
Simulated User Bots: Real Time Testing of Insider Threat Detection Systems
Realistic user bots inject malicious behavior to continuously test insider-threat detection in synthetic and live university networks.
paper
Oceans · 2012
Oversampling MAVS for Reduction of Vortex-Shedding Velocity Sensing Noise
Oversampling and filtering reduce vortex-shedding noise in current meters, improving signal-to-noise by 3×.
paper