J
John Regehr
Researcher at University of Utah
Publications - 87
Citations - 4220
John Regehr is an academic researcher from University of Utah. The author has contributed to research in topics: Compiler & Scheduling (computing). The author has an hindex of 34, co-authored 84 publications receiving 3740 citations. Previous affiliations of John Regehr include Microsoft & University of Virginia.
Papers
More filters
Journal ArticleDOI
Finding and understanding bugs in C compilers
TL;DR: Csmith, a randomized test-case generation tool, is created and spent three years using it to find compiler bugs, and a collection of qualitative and quantitative results about the bugs it found are presented.
Proceedings ArticleDOI
Test-case reduction for C compiler bugs
TL;DR: It is concluded that effective program reduction requires more than straightforward delta debugging, so three new, domain-specific test-case reducers are designed and implemented based on a novel framework in which a generic fixpoint computation invokes modular transformations that perform reduction operations.
Proceedings ArticleDOI
HLS: a framework for composing soft real-time schedulers
John Regehr,John A. Stankovic +1 more
TL;DR: This paper describes a system of guarantees that permits a general hierarchy of soft real-time schedulers one that contains arbitrary scheduling algorithms at all points within the hierarchy - to be analyzed and results in deterministic guarantees for threads at the leaves of the hierarchy.
Proceedings ArticleDOI
Taming compiler fuzzers
TL;DR: This paper formulates and addresses the fuzzer taming problem: given a potentially large number of random test cases that trigger failures, order them such that diverse, interesting test cases are highly ranked.
Proceedings ArticleDOI
Efficient memory safety for TinyOS
TL;DR: This work provides efficient memory and type safety for TinyOS 2 applications running on the Mica2, MicaZ, and TelosB platforms and shows that safety can be exploited to increase the availability of sensor networks applications even when memory errors are left unfixed.