World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5441
World Ranking
10334
National Ranking
4331

Overview

John Regehr is affiliated with the University of Utah in the United States and conducts research primarily in the field of Computer Science. Their work spans several subfields including Artificial Intelligence, Hardware and Architecture, Software, Information Systems, and Signal Processing.

Their research focuses on topics such as Software Testing and Debugging Techniques, Parallel Computing and Optimization Techniques, Software Engineering Research, Advanced Malware Detection Techniques, Embedded Systems Design Techniques, Logic, Programming, and Type Systems, as well as Reservoir Engineering and Simulation Methods.

John Regehr has published extensively, with a notable number of publications appearing in the Proceedings of the ACM on Programming Languages. Other publication venues include arXiv (Cornell University) and the Artifact Digital Object Group.

Recent papers authored by or involving John Regehr include:

  • Random testing for C and C++ compilers with YARPGen, 2020, Proceedings of the ACM on Programming Languages
  • Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages, 2023, Proceedings of the ACM on Programming Languages
  • Dataflow-based pruning for speeding up superoptimization, 2020, Proceedings of the ACM on Programming Languages
  • Hydra: Generalizing Peephole Optimizations with Program Synthesis, 2024, Proceedings of the ACM on Programming Languages
  • Minotaur: A SIMD-Oriented Synthesizing Superoptimizer, 2024, Proceedings of the ACM on Programming Languages

Frequent coauthors who have collaborated on multiple publications with John Regehr include:

  • Stefan Mada
  • Vsevolod Livinskii
  • Dmitry Babokin
  • Manasij Mukherjee
  • Zhengyang Liu

Best Publications

  • Finding and understanding bugs in C compilers

    Xuejun Yang;Yang Chen;Eric Eide;John Regehr

  • Test-case reduction for C compiler bugs

    John Regehr;Yang Chen;Pascal Cuoq;Eric Eide

  • Eliminating stack overflow by abstract interpretation

    John Regehr;Alastair Reid;Kirk Webb

  • Understanding Integer Overflow in C/C++

    Will Dietz;Peng Li;John Regehr;Vikram Adve

  • HLS: a framework for composing soft real-time schedulers

    J. Regehr;J.A. Stankovic

  • Taming compiler fuzzers

    Yang Chen;Alex Groce;Chaoqiang Zhang;Weng-Keen Wong

  • Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems

    Michael B. Jones;John Regehr

  • Efficient memory safety for TinyOS

    Nathan Cooprider;Will Archer;Eric Eide

  • Intent fuzzer: crafting intents of death

    Raimondas Sasnauskas;John Regehr

  • Provably correct peephole optimizations with alive

    Nuno P. Lopes;David Menendez;Santosh Nagarakatte;John Regehr

  • Scheduling tasks with mixed preemption relations for robustness to timing faults

    J. Regehr

  • Swarm testing

    Alex Groce;Chaoqiang Zhang;Eric Eide;Yang Chen

  • Random testing of interrupt-driven software

    John Regehr

  • T-check: bug finding for sensor networks

    Peng Li;John Regehr

  • Volatiles are miscompiled, and what to do about it

    Eric Eide;John Regehr

  • Random testing for C and C++ compilers with YARPGen

    Vsevolod Livinskii;Dmitry Babokin;John Regehr

  • Testing static analyzers with randomly generated programs

    Pascal Cuoq;Benjamin Monate;Anne Pacalet;Virgile Prevosto

  • Evolving real-time systems using hierarchical scheduling and concurrency analysis

    J. Regehr;A. Reid;K. Webb;M. Parker

  • ARMor: fully verified software fault isolation

    Lu Zhao;Guodong Li;Bjorn De Sutter;John Regehr

  • Surviving sensor network software faults

    Yang Chen;Omprakash Gnawali;Maria Kazandjieva;Philip Levis

Frequent Co-Authors

John A. Stankovic
John A. Stankovic University of Virginia
Alex Groce
Alex Groce Northern Arizona University
Insup Lee
Insup Lee University of Pennsylvania
Peter Bailis
Peter Bailis Stanford University
Vikram Adve
Vikram Adve University of Illinois at Urbana-Champaign
Philip Levis
Philip Levis Stanford University
Oleg Sokolsky
Oleg Sokolsky University of Pennsylvania
Matthew Flatt
Matthew Flatt University of Utah
Weng-Keen Wong
Weng-Keen Wong Oregon State University
Luca P. Carloni
Luca P. Carloni Columbia University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens diverse career opportunities. For students interested in advancing quickly, enrolling in the 1 year masters degree programs lets you earn an advanced credential in less time, accelerating your career growth.

If budget is a major concern, consider the cheapest mba programs online or the cheapest online master's in artificial intelligence. These affordable programs can boost your technical and leadership skills without a large financial burden.

For those looking to quickly enter the workforce, pursuing the fastest degree to get can deliver solid returns in a short time. Whether your aim is a generalist role or a specialized focus such as AI, these pathways can help you achieve your professional goals efficiently and economically.

Best Scientists Citing John Regehr

Trending Scientists