default search action
John Regehr
Person information
- affiliation: University of Utah, Salt Lake City, Utah, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Manasij Mukherjee
, John Regehr:
Hydra: Generalizing Peephole Optimizations with Program Synthesis. Proc. ACM Program. Lang. 8(OOPSLA1): 725-753 (2024) - [j14]Zhengyang Liu
Minotaur: A SIMD-Oriented Synthesizing Superoptimizer. Proc. ACM Program. Lang. 8(OOPSLA2): 1561-1585 (2024) - [c47]Yuyou Fan, John Regehr:
High-Throughput, Formal-Methods-Assisted Fuzzing for LLVM. CGO 2024: 349-358 - 2023
- [j13]Vsevolod Livinskii
Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages. Proc. ACM Program. Lang. 7(PLDI): 1826-1847 (2023) - [i4]Zhengyang Liu, Stefan Mada, John Regehr:
Minotaur: A SIMD-Oriented Synthesizing Superoptimizer. CoRR abs/2306.00229 (2023) - 2021
- [c46]Nuno P. Lopes, Juneyoung Lee, Chung-Kil Hur, Zhengyang Liu, John Regehr:
Alive2: bounded translation validation for LLVM. PLDI 2021: 65-79 - 2020
- [j12]Manasij Mukherjee, Pranav Kant, Zhengyang Liu, John Regehr:
Dataflow-based pruning for speeding up superoptimization. Proc. ACM Program. Lang. 4(OOPSLA): 177:1-177:24 (2020) - [j11]Vsevolod Livinskii, Dmitry Babokin, John Regehr:
Random testing for C and C++ compilers with YARPGen. Proc. ACM Program. Lang. 4(OOPSLA): 196:1-196:25 (2020) - [c45]Jubi Taneja, Zhengyang Liu, John Regehr:
Testing static analyses for precision and soundness. CGO 2020: 81-93
2010 – 2019
- 2018
- [j10]Nuno P. Lopes
Practical verification of peephole optimizations with Alive. Commun. ACM 61(2): 84-91 (2018) - [j9]Juneyoung Lee, Chung-Kil Hur, Ralf Jung
Reconciling high-level optimizations and low-level code in LLVM. Proc. ACM Program. Lang. 2(OOPSLA): 125:1-125:28 (2018) - [i3]Nuno P. Lopes, John Regehr:
Future Directions for Optimizing Compilers. CoRR abs/1809.02161 (2018) - 2017
- [j8]John Regehr, Peter Bailis:
Research for practice: vigorous public debates in academic computer science. Commun. ACM 60(12): 48-50 (2017) - [j7]John Regehr:
Vigorous Public Debates in Academic Computer Science. ACM Queue 15(3): 70 (2017) - [c44]Juneyoung Lee, Yoonseung Kim, Youngju Song
Taming undefined behavior in LLVM. PLDI 2017: 633-647 - [i2]Raimondas Sasnauskas, Yang Chen, Peter Collingbourne, Jeroen Ketema, Jubi Taneja, John Regehr:
Souper: A Synthesizing Superoptimizer. CoRR abs/1711.04422 (2017) - 2016
- [j6]John Regehr:
STACKing up undefined behaviors: technical perspective. Commun. ACM 59(3): 98 (2016) - [j5]Alex Groce, Mohammad Amin Alipour
Cause reduction: delta debugging, even without bugs. Softw. Test. Verification Reliab. 26(1): 40-68 (2016) - [c43]Anton Burtsev, David Johnson, Mike Hibler, Eric Eide, John Regehr:
Abstractions for Practical Virtual Machine Replay. VEE 2016: 93-106 - 2015
- [j4]Will Dietz, Peng Li, John Regehr, Vikram S. Adve:
Understanding Integer Overflow in C/C++. ACM Trans. Softw. Eng. Methodol. 25(1): 2:1-2:29 (2015) - [c42]Nuno P. Lopes
Provably correct peephole optimizations with alive. PLDI 2015: 22-32 - 2014
- [c41]Alex Groce, Mohammad Amin Alipour
Cause Reduction for Quick Testing. ICST 2014: 243-252 - [c40]Raimondas Sasnauskas, John Regehr:
Intent fuzzer: crafting intents of death. WODA+PERTEA@ISSTA 2014: 1-5 - 2013
- [c39]Alex Groce, Chaoqiang Zhang, Mohammad Amin Alipour
Help, help, i'm being suppressed! The significance of suppressors in software testing. ISSRE 2013: 390-399 - [c38]Yang Chen, Alex Groce, Chaoqiang Zhang, Weng-Keen Wong, Xiaoli Z. Fern, Eric Eide
Taming compiler fuzzers. PLDI 2013: 197-208 - 2012
- [c37]Will Dietz, Peng Li, John Regehr, Vikram S. Adve:
Understanding integer overflow in C/C++. ICSE 2012: 760-770 - [c36]Alex Groce, Chaoqiang Zhang, Eric Eide, Yang Chen, John Regehr:
Swarm testing. ISSTA 2012: 78-88 - [c35]Pascal Cuoq, Benjamin Monate, Anne Pacalet, Virgile Prevosto
Testing Static Analyzers with Randomly Generated Programs. NASA Formal Methods 2012: 120-125 - [c34]John Regehr, Yang Chen, Pascal Cuoq, Eric Eide
Test-case reduction for C compiler bugs. PLDI 2012: 335-346 - [e2]Ahmed Jerraya, Luca P. Carloni, Florence Maraninchi, John Regehr:
Proceedings of the 12th International Conference on Embedded Software, EMSOFT 2012, part of the Eighth Embedded Systems Week, ESWeek 2012, Tampere, Finland, October 7-12, 2012. ACM 2012, ISBN 978-1-4503-1425-1 [contents] - 2011
- [c33]Lu Zhao, Guodong Li, Bjorn De Sutter, John Regehr:
ARMor: fully verified software fault isolation. EMSOFT 2011: 289-298 - [c32]Xuejun Yang, Yang Chen, Eric Eide
Finding and understanding bugs in C compilers. PLDI 2011: 283-294 - 2010
- [c31]Peng Li, John Regehr:
T-check: bug finding for sensor networks. IPSN 2010: 174-185 - [c30]Jianjun Duan, John Regehr:
Correctness Proofs for Device Drivers in Embedded Systems. SSV 2010
2000 – 2009
- 2009
- [c29]Jon Rafkind, Adam Wick, John Regehr, Matthew Flatt:
Precise garbage collection for C. ISMM 2009: 39-48 - [c28]Xuejun Yang, Nathan Cooprider, John Regehr:
Eliminating the call stack to save RAM. LCTES 2009: 60-69 - [c27]Yang Chen, Omprakash Gnawali
Surviving sensor network software faults. SOSP 2009: 235-246 - 2008
- [j3]Nathan Cooprider, John Regehr:
Using sequencing to trigger a better analysis. SIGBED Rev. 5(1): 9 (2008) - [c26]Venkat Chakravarthy, John Regehr, Eric Eide
Edicts: implementing features with flexible binding times. AOSD 2008: 108-119 - [c25]Eric Eide, John Regehr:
Volatiles are miscompiled, and what to do about it. EMSOFT 2008: 255-264 - [e1]Krisztián Flautner, John Regehr:
Proceedings of the 2008 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'08), Tucson, AZ, USA, June 12-13, 2008. ACM 2008, ISBN 978-1-60558-104-0 [contents] - 2007
- [c24]Will Archer, Philip Alexander Levis, John Regehr:
Interface contracts for TinyOS. IPSN 2007: 158-165 - [c23]Nathan Cooprider, John Regehr:
Offline compression for on-chip ram. PLDI 2007: 363-372 - [c22]Usa Sammapun
Statistical Runtime Checking of Probabilistic Properties. RV 2007: 164-175 - [c21]Nathan Cooprider, Will Archer, Eric Eide
Efficient memory safety for TinyOS. SenSys 2007: 205-218 - [r1]John Regehr:
Safe and Structured Use of Interrupts in Real-Time and Embedded Software. Handbook of Real-Time and Embedded Systems 2007 - [i1]Oleg Sokolsky, Usa Sammapun, John Regehr, Insup Lee:
Runtime Verification for Wireless Sensor Network Applications. Runtime Verification 2007 - 2006
- [j2]John Regehr:
From the Editor: Real-Time and Embedded Systems-Teaching Reliability. IEEE Distributed Syst. Online 7(5) (2006) - [c20]John Regehr, Nathan Cooprider, David Gay:
Atomicity and visibility in tiny embedded systems. PLOS 2006: 2 - [c19]John Regehr, Nathan Cooprider, Will Archer, Eric Eide
Efficient type and memory safety for tiny embedded systems. PLOS 2006: 6 - [c18]John Regehr, Usit Duongsaa:
Deriving abstract transfer functions for analyzing embedded software. LCTES 2006: 34-43 - [c17]Nathan Cooprider, John Regehr:
Pluggable abstract domains for analyzing embedded software. LCTES 2006: 44-53 - [c16]John Regehr, Nathan Cooprider:
Interrupt Verification via Thread Verification. TV@FLoC 2006: 139-150 - 2005
- [j1]John Regehr, Alastair Reid
Eliminating stack overflow by abstract interpretation. ACM Trans. Embed. Comput. Syst. 4(4): 751-778 (2005) - [c15]John Regehr:
Random testing of interrupt-driven software. EMSOFT 2005: 290-298 - [c14]John Regehr, Usit Duongsaa:
Preventing interrupt overload. LCTES 2005: 50-58 - 2004
- [c13]John Regehr, Alastair Reid
HOIST: a system for automatically deriving static analyzers for embedded systems. ASPLOS 2004: 133-143 - [c12]Eric Eide, Tim Stack, John Regehr, Jay Lepreau:
Dynamic CPU Management for Real-Time, Middleware-Based Systems. IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 286-295 - 2003
- [c11]John Regehr, Alastair Reid
Eliminating Stack Overflow by Abstract Interpretation. EMSOFT 2003: 306-322 - [c10]John Regehr, Alastair Reid
Evolving real-time systems using hierarchical scheduling and concurrency analysis. RTSS 2003: 25-36 - 2002
- [c9]Eric Eide, Alastair Reid
Static and dynamic structure in design patterns. ICSE 2002: 208-218 - [c8]John Regehr:
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults. RTSS 2002: 315-326 - [c7]John Regehr:
Inferring Scheduling Behavior with Hourglass. USENIX ATC, FREENIX Track 2002: 143-156 - 2001
- [c6]John Regehr, Jay Lepreau:
The case for using middleware to manage diverse soft real-time schedulers. M3W@MM 2001: 23-27 - [c5]John Regehr, John A. Stankovic:
Augmented CPU Reservations: Towards Predictable Execution on General-Purpose Operating System. IEEE Real Time Technology and Applications Symposium 2001: 141-148 - [c4]Michael B. Jones, John Regehr, Stefan Saroiu:
Two Case Studies in Predictable Application Scheduling Using Rialto/NT. IEEE Real Time Technology and Applications Symposium 2001: 157-164 - [c3]John Regehr, John A. Stankovic:
HLS: A Framework for Composing Soft Real-Time Schedulers. RTSS 2001: 3-14
1990 – 1999
- 1999
- [c2]Michael B. Jones, John Regehr:
The Problems You're Having May Not Be the Problems You Think You're Having: Results from a Latency Study of Windows NT. Workshop on Hot Topics in Operating Systems 1999: 96-101 - [c1]Michael B. Jones, John Regehr:
The Problems You're Having May Not Be the Problems You Think You're Having: Results from a Latency Study of Windows NT. IEEE Real Time Technology and Applications Symposium 1999: 287-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: