The Problems You're Having May Not Be the Problems You Think You're Having: Results from a Latency Study of Windows NT. - Michael B. Jones; John Regehr (Workshop on Hot Topics in Operating Systems, 1999)

The case for using middleware to manage diverse soft real-time schedulers. - John Regehr; Jay Lepreau (M3W@MM, 2001)

Two Case Studies in Predictable Application Scheduling Using Rialto/NT. - Michael B. Jones; John Regehr; Stefan Saroiu (IEEE Real Time Technology and Applications Symposium, 2001)

Augmented CPU Reservations: Towards Predictable Execution on General-Purpose Operating System. - John Regehr; John A. Stankovic (IEEE Real Time Technology and Applications Symposium, 2001)

HLS: A Framework for Composing Soft Real-Time Schedulers. - John Regehr; John A. Stankovic (RTSS, 2001)

Static and dynamic structure in design patterns. - Eric Eide; Alastair Reid 001; John Regehr; Jay Lepreau (ICSE, 2002)

Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults. - John Regehr (RTSS, 2002)

Inferring Scheduling Behavior with Hourglass. - John Regehr (USENIX ATC, FREENIX Track, 2002)

Evolving real-time systems using hierarchical scheduling and concurrency analysis. - John Regehr; Alastair Reid 001; Kirk Webb; Michael A. Parker; Jay Lepreau (RTSS, 2003)

HOIST: a system for automatically deriving static analyzers for embedded systems. - John Regehr; Alastair Reid 001 (ASPLOS, 2004)

Dynamic CPU Management for Real-Time, Middleware-Based Systems. - Eric Eide; Tim Stack; John Regehr; Jay Lepreau (IEEE Real-Time and Embedded Technology and Applications Symposium, 2004)

Random testing of interrupt-driven software. - John Regehr (EMSOFT, 2005)

Preventing interrupt overload. - John Regehr; Usit Duongsaa (LCTES, 2005)

Eliminating stack overflow by abstract interpretation. - John Regehr; Alastair Reid 001; Kirk Webb (ACM Trans. Embed. Comput. Syst., 2005)

Efficient type and memory safety for tiny embedded systems. - John Regehr; Nathan Cooprider; Will Archer; Eric Eide (PLOS, 2006)

Atomicity and visibility in tiny embedded systems. - John Regehr; Nathan Cooprider; David Gay (PLOS, 2006)

Pluggable abstract domains for analyzing embedded software. - Nathan Cooprider; John Regehr (LCTES, 2006)

Deriving abstract transfer functions for analyzing embedded software. - John Regehr; Usit Duongsaa (LCTES, 2006)

From the Editor: Real-Time and Embedded Systems-Teaching Reliability. - John Regehr (IEEE Distributed Syst. Online, 2006)

Interrupt Verification via Thread Verification. - John Regehr; Nathan Cooprider (TV@FLoC, 2006)

Runtime Verification for Wireless Sensor Network Applications. - Oleg Sokolsky; Usa Sammapun; John Regehr; Insup Lee 001 (Runtime Verification, 2007)

Interface contracts for TinyOS. - Will Archer; Philip Alexander Levis; John Regehr (IPSN, 2007)

Offline compression for on-chip ram. - Nathan Cooprider; John Regehr (PLDI, 2007)

Statistical Runtime Checking of Probabilistic Properties. - Usa Sammapun; Insup Lee 001; Oleg Sokolsky; John Regehr (RV, 2007)

Efficient memory safety for TinyOS. - Nathan Cooprider; Will Archer; Eric Eide; David Gay; John Regehr (SenSys, 2007)

Safe and Structured Use of Interrupts in Real-Time and Embedded Software. - John Regehr (Handbook of Real-Time and Embedded Systems, 2007)

Edicts: implementing features with flexible binding times. - Venkat Chakravarthy; John Regehr; Eric Eide (AOSD, 2008)

Volatiles are miscompiled, and what to do about it. - Eric Eide; John Regehr (EMSOFT, 2008)

Using sequencing to trigger a better analysis. - Nathan Cooprider; John Regehr (SIGBED Rev., 2008)

Precise garbage collection for C. - Jon Rafkind; Adam Wick; John Regehr; Matthew Flatt (ISMM, 2009)

Eliminating the call stack to save RAM. - Xuejun Yang; Nathan Cooprider; John Regehr (LCTES, 2009)

Surviving sensor network software faults. - Yang Chen 024; Omprakash Gnawali; Maria A. Kazandjieva; Philip Alexander Levis; John Regehr (SOSP, 2009)

T-check: bug finding for sensor networks. - Peng Li; John Regehr (IPSN, 2010)

Correctness Proofs for Device Drivers in Embedded Systems. - Jianjun Duan; John Regehr (SSV, 2010)

ARMor: fully verified software fault isolation. - Lu Zhao 002; Guodong Li; Bjorn De Sutter; John Regehr (EMSOFT, 2011)

Finding and understanding bugs in C compilers. - Xuejun Yang; Yang Chen 024; Eric Eide; John Regehr (PLDI, 2011)

Swarm testing. - Alex Groce; Chaoqiang Zhang; Eric Eide; Yang Chen 024; John Regehr (ISSTA, 2012)

Testing Static Analyzers with Randomly Generated Programs. - Pascal Cuoq; Benjamin Monate; Anne Pacalet; Virgile Prevosto; John Regehr; Boris Yakobowski; Xuejun Yang (NASA Formal Methods, 2012)

Test-case reduction for C compiler bugs. - John Regehr; Yang Chen 024; Pascal Cuoq; Eric Eide; Chucky Ellison; Xuejun Yang (PLDI, 2012)

Help, help, i'm being suppressed! The significance of suppressors in software testing. - Alex Groce; Chaoqiang Zhang; Mohammad Amin Alipour; Eric Eide; Yang Chen 024; John Regehr (ISSRE, 2013)

Taming compiler fuzzers. - Yang Chen 024; Alex Groce; Chaoqiang Zhang; Weng-Keen Wong; Xiaoli Z. Fern; Eric Eide; John Regehr (PLDI, 2013)

Cause Reduction for Quick Testing. - Alex Groce; Mohammad Amin Alipour; Chaoqiang Zhang; Yang Chen 024; John Regehr (ICST, 2014)

Intent fuzzer: crafting intents of death. - Raimondas Sasnauskas; John Regehr (WODA+PERTEA@ISSTA, 2014)

Provably correct peephole optimizations with alive. - Nuno P. Lopes; David Menendez; Santosh Nagarakatte; John Regehr (PLDI, 2015)

Understanding Integer Overflow in C/C++. - Will Dietz; Peng Li; John Regehr; Vikram S. Adve (ACM Trans. Softw. Eng. Methodol., 2015)

Abstractions for Practical Virtual Machine Replay. - Anton Burtsev; David Johnson 004; Mike Hibler; Eric Eide; John Regehr (VEE, 2016)

STACKing up undefined behaviors: technical perspective. - John Regehr (Commun. ACM, 2016)

Cause reduction: delta debugging, even without bugs. - Alex Groce; Mohammad Amin Alipour; Chaoqiang Zhang; Yang Chen 024; John Regehr (Softw. Test. Verification Reliab., 2016)

Taming undefined behavior in LLVM. - Juneyoung Lee; Yoonseung Kim; Youngju Song; Chung-Kil Hur; Sanjoy Das; David Majnemer; John Regehr; Nuno P. Lopes (PLDI, 2017)

Research for practice: vigorous public debates in academic computer science. - John Regehr; Peter Bailis (Commun. ACM, 2017)

Souper: A Synthesizing Superoptimizer. - Raimondas Sasnauskas; Yang Chen 024; Peter Collingbourne; Jeroen Ketema; Jubi Taneja; John Regehr (CoRR, 2017)

Vigorous Public Debates in Academic Computer Science. - John Regehr (ACM Queue, 2017)

Practical verification of peephole optimizations with Alive. - Nuno P. Lopes; David Menendez; Santosh Nagarakatte; John Regehr (Commun. ACM, 2018)

Future Directions for Optimizing Compilers. - Nuno P. Lopes; John Regehr (CoRR, 2018)

Reconciling high-level optimizations and low-level code in LLVM. - Juneyoung Lee; Chung-Kil Hur; Ralf Jung 002; Zhengyang Liu 003; John Regehr; Nuno P. Lopes (Proc. ACM Program. Lang., 2018)

Testing static analyses for precision and soundness. - Jubi Taneja; Zhengyang Liu 003; John Regehr (CGO, 2020)

Random testing for C and C++ compilers with YARPGen. - Vsevolod Livinskii; Dmitry Babokin; John Regehr (Proc. ACM Program. Lang., 2020)

Dataflow-based pruning for speeding up superoptimization. - Manasij Mukherjee; Pranav Kant; Zhengyang Liu 003; John Regehr (Proc. ACM Program. Lang., 2020)

Alive2: bounded translation validation for LLVM. - Nuno P. Lopes; Juneyoung Lee; Chung-Kil Hur; Zhengyang Liu 003; John Regehr (PLDI, 2021)

Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages. - Vsevolod Livinskii; Dmitry Babokin; John Regehr (Proc. ACM Program. Lang., 2023)

High-Throughput, Formal-Methods-Assisted Fuzzing for LLVM. - Yuyou Fan; John Regehr (CGO, 2024)

Minotaur: A SIMD-Oriented Synthesizing Superoptimizer. - Zhengyang Liu 003; Stefan Mada; John Regehr (Proc. ACM Program. Lang., 2024)

Hydra: Generalizing Peephole Optimizations with Program Synthesis. - Manasij Mukherjee; John Regehr (Proc. ACM Program. Lang., 2024)

First-Class Verification Dialects for MLIR. - Mathieu Fehr; Yuyou Fan; Hugo Pompougnac; John Regehr; Tobias Grosser (Proc. ACM Program. Lang., 2025)