incomplete pubs list from DBLP
Google Scholar author page

CHI 2017: VoxPL: Programming with the Wisdom of the Crowd, with Dan Barowy, Dan Goldstein, and Sid Suri.
ASPLOS 2017: BROWSIX: Bridging the Gap Between Unix and the Browser, with Bobby Powers and John Vilk.
CACM Research Highlight 2016: AutoMan: A Platform for Integrating Human-Based and Digital Computation, with Dan Barowy, Charlie Curtsinger, and Andrew McGregor.
OOPSLA 2016: Prioritized Garbage Collection: Explicit GC Support for Software Caches, with Sam Guyer and Diogenes Nunez.
ICSE 2016: DoubleTake: Fast and Precise Error Detection via Evidence-Based Dynamic Analysis, with Charlie Curtsinger and Tongping Liu.
SOSP 2015: Coz: Finding Code that Counts with Causal Profiling, with Charlie Curtsinger. Best Paper Award.
OOPSLA 2014: CheckCell: Data Debugging for Spreadsheets, with Dan Barowy and Dimitar Gochev.
OOPSLA 2014: SurveyMan: Programming and Automatically Debugging Surveys, with Emma Tosch. Best Paper Award.
PLDI 2014: Doppio: Breaking the Browser Language Barrier, with John Vilk. Distinguished Artifact Award.
PPoPP 2014: Predator: Predictive False Sharing Detection, with Tongping Liu, Chen Tian, and Ziang Hu.
ASPLOS 2013: Stabilizer: Statistically Sound Performance Evaluation, with Charlie Curtsinger.
Communications of the ACM: Software Needs Seatbelts and Airbags. (September 2012)
ACM Queue: Software Needs Seatbelts and Airbags.
ACM TECS 2012: PROARTIS: Probabilistically Analysable Real-Time Systems, with Fran Cazorla, Eduardo Quinones, Tullio Vardanega, Liliana Cucu, Benoit Triquet, Guillem Bernat, Jaume Abella, Franck Wartel, Michael Houston, Luca Santinelli, Leonidas Kosmidis, Code Lo, and Dorin Maxim.
OOPSLA 2012: AutoMan: A Platform for Integrating Human-Based and Digital Computation, with Dan Barowy, Charlie Curtsinger, and Andrew McGregor. Nominated by SIGPLAN for an ACM Research Highlight.
SOSP 2011: Dthreads: Efficient and Deterministic Multithreading, with Tongping Liu and Charlie Curtsinger.
OOPSLA 2011: Precise Detection and Automatic Mitigation of False Sharing (Sheriff), with Tongping Liu.
PhD Thesis: Hardening Software Against Memory Errors and Attack, Gene Novark (advisor: Emery Berger), Feb 2011.
CCS 2010: DieHarder: Securing the Heap, with Gene Novark.
OOPSLA 2009: Grace: Safe Multithreaded Programming for C/C++, with Ting Yang, Tongping Liu, and Gene Novark.
ECRTS 2009: Using Randomized Caches in Real-Time Systems, with Eduardo Quinones, Guillem Bernat, and Francisco Cazorla.
PLDI 2009: Efficiently and Precisely Locating Memory Leaks and Bloat, with Gene Novark and Ben Zorn.
CACM Research Highlight 2008: Exterminator: Automatically Correcting Memory Errors with High Probabilitywith Gene Novark and Ben Zorn. ACM Research Highlight.
OSDI 2008: Redline: First-Class Support for Interactivity in Commodity Operating Systems , with Ting Yang, Scott Kaplan, and Eliot Moss.
ASPLOS 2008: Archipelago: Trading Address Space for Reliability and Security, with Vitaliy Lvin, Gene Novark, and Ben Zorn.
ACM Transactions on Storage:Contributing Storage Using the Transparent File System
with Jim Cipar and Mark Corner.
A file system that lets background applications use all of your available disk space, without impacting your use of your computer.
Supersedes the FAST 07 paper below.
SenSys 2007: Eon: A Language and Runtime System for Perpetual Systems
with Jacob Sorber, Alex Kostadinov, Matt Brennan, Matt Garber, andMark Corner
An energy-aware programming language that supports perpetual systems: these are systems that are intended to run forever and must harvest their energy from the environment.
PLDI 2007: Exterminator: Automatically Correcting Memory Errors with High Probability
with Gene Novark & Ben Zorn
A system that automatically corrects heap-based memory errors without programmer intervention. Exterminator exploits randomization and replication to pinpoint errors with high precision. Using this information, Exterminator derives runtime patches that fix these errors in current and subsequent executions.
FAST 2007: TFS: A Transparent File System for Contributory Storage
with James Cipar & Mark Corner
A file system that lets background applications use all of your available disk space, without impacting your use of your computer. Best Paper Award.
OSDI 2006: CRAMM: Virtual Memory Support for Garbage-Collected Applications
with Ting Yang, Scott F. Kaplan, and J. Eliot B. Moss.
A virtual memory manager that, combined with a collector-neutral heap sizing algorithm, ensures that garbage-collected applications run as fast as possible while avoiding paging.
USENIX 2006: Flux: A Language for Programming High-Performance Servers
with Brendan Burns, Kevin Grimaldi, Alex Kostadinov, & Mark Corner.
Flux is a concise programming language for writing servers that scale and are deadlock-free. A Flux programmer uses off-the-shelf, sequential C and C++ code, and describes their composition; the Flux compiler then generates a deadlock-free, high-concurrency server. Flux also makes it easy to analyze and predict server performance, because the Flux compiler can also generate discrete event simulators that reflect actual server performance.
You can download Flux.
Flux: Composing Efficient and Scalable Servers (tech report, supersedes the USENIX 06 paper above).
USENIX 2006: Transparent Contribution of Memory
with James Cipar and Mark Corner
Introduces transparent memory management (TMM), which lets you run background jobs that use your disk and virtual memory without impacting your use of the machine, even after you leave your machine unattended for an extended period of time. You can download TMM.
PLDI 2006: DieHard: Probabilistic Memory Safety for Unsafe Languages
with Ben Zorn.
DieHard uses randomization and replication to transparently make C and C++ programs tolerate a wide range of errors, including buffer overflows and dangling pointers. Instead of crashing or running amok, DieHard lets programs continue to run correctly in the face of memory errors with high probability. Using DieHard also makes programs highly resistant to heap-based hacker attacks. Directly inspired the Windows 7 Fault-Tolerant Heap. Winner of the PLDI Most Influential Paper Award.

You can download DieHard.
DieHard: Efficient Probabilistic Memory Safety (UMass CS TR 07-17; supersedes the PLDI 06 paper above)
OOPSLA 2005: Quantifying the Performance of Garbage Collection vs. Explicit Memory Management
with Matthew Hertz.
This paper attempts to answer an age-old question: is garbage collection faster/slower/the same speed as malloc/free? We introduce oracular memory management, an approach that lets us measure unaltered Java programs as if they used malloc and free. The result: a good GC can match the performance of a good allocator, but it takes 5X more space. If physical memory is tight, however, conventional garbage collectors suffer an order-of-magnitude performance penalty.
MSP 2005: A Locality-Improving Dynamic Memory Allocator
with Yi Feng.
Presents Vam, a memory allocator that improves cache-level and virtual memory locality. Vam is distributed with Heap Layers.
PLDI 2005: Garbage Collection without Paging
with Matthew Hertz & Yi Feng.
Introduces bookmarking collection, a GC algorithm that works with the virtual memory manager to eliminate paging. Just before memory is paged out, the collector “bookmarks” the targets of pointers from the pages. Using these bookmarks, BC can perform full garbage collections without loading the pages back from disk. By performing in-memory garbage collections, BC can speed up Java programs by orders of magnitude (up to 41X).Download the bookmarking collector and associated Linux patches.
OOPSLA 2004: MC2: High-Performance Garbage Collection for Memory-Constrained Environments
with Naren Sachindran and Eliot Moss.
MC2 is an incremental, space-efficient garbage collector that has high throughput and low pause times.
ISMM 2004: Automatic Heap Sizing: Taking Real Memory into Account
with Ting Yang, Matthew Hertz, Scott Kaplan, & Eliot Moss.
A GC-independent approach that cooperates with an enhanced virtual memory manager to dynamically pick the best heap size while a program is running.Talk (PowerPoint). This work is subsumed by our OSDI 2006 paper, above.
OOPSLA 2002: Reconsidering Custom Memory Allocation
with Ben Zorn & Kathryn McKinley
Finds that a good general-purpose allocator is better than all custom allocators except regions, but these have serious problems. Introduces reaps (regions + heaps), which combine the flexibility and space efficiency of heaps with the performance of regions.
Winner of OOPSLA Most Influential Paper Award.
PLDI 2001: Composing High-Performance Memory Allocators
with Ben Zorn & Kathryn McKinley
Introduces Heap Layers, a flexible infrastructure for building memory allocators that leverages C++ template mixins to achieve high performance.
Heap Layers source.
ASPLOS-IX: Hoard: A Scalable Memory Allocator for Multithreaded Applications
with Kathryn McKinley, Robert Blumofe, & Paul Wilson
Identifies problems of heap contention, space blowup, and allocator-induced false sharing in previous allocators; introduces Hoard, a fast memory allocator that solves these problems. Inspired design of Mac OS X allocator; widely used in industry.
Note: Hoard’s design has undergone a number of changes since the publication of this article.
Hoard home page.
Ph.D. THESIS: Memory Management for High-Performance Applications
Department of Computer Sciences, The University of Texas at Austin (2002, TR02-52).
nominated for ACM best dissertation award
10th SIAM Conference on Parallel Processing for Scientific Computing:Customizing Software Libraries for Performance Portability
with Sam Guyer & Calvin Lin
WCBC 99 (The 1999 Workshop on Cluster-Based Computing): Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs
with James C. Browne
Detecting Errors with Whole-Program Configurable Dataflow Analysis: UTCS Technical Report TR-02-04
with Sam Guyer & Calvin Lin
IJHPCA 2000 (Int’l Journal of High-Performance Computing Applications, Winter 2000): Compositional Development of Performance Models in POEMS
with J.C. Browne & A. Dube
International Journal for Numerical Methods in Engineering, Volume 42, 1998: A Fast Solution Method for Three-Dimensional Many-Particle Problems of Linear Elasticity
with Yuhong Fu, Kenneth Klimkowski, Greg Rodin, J.C. Browne, Jurgen Singer, Robert van de Geijn, & Kumar Vemagantitechnical reports (not published elsewhere)
UMass CS TR 07-17: DieHard: Efficient Probabilistic Memory Safety
(supersedes the PLDI 06 paper above)
UMass CS TR 06-28: HeapShield: Library-Based Heap Overflow Protection for Free
HeapShield eliminates heap buffer overflows through libraries like strcpy and is effectively “free” (it has minimal or no impact on runtime performance).
UMass CS TR 06-06: Custom Object Layout for Garbage-Collected Languages
with Gene Novark and Trevor Strohman.
Shows how programmers can increase locality by supplying “iterators” that a lightly-customized garbage collector then uses to layout class data.