Peter Ohmann

Learn More
We examine the spectrum of supersymmetric particles predicted by grand unified theoretical (GUT) models where the electroweak symmetry breaking is accomplished radiatively. We evolve the soft supersymmetry breaking parameters according to the renormalization group equations (RGE). The minimization of the Higgs potential is conveniently described by means of(More)
We make a numerical study of gauge and Yukawa unification in supersymmetric grand unified models and examine the quantitative implications of fermion mass ansätze at the grand unified scale. Integrating the renormalization group equations with α1(MZ) and α2(MZ) as inputs, we find α3(MZ) ≃ 0.111(0.122) for MSUSY = mt and α3(MZ) ≃ 0.106(0.116) for MSUSY = 1(More)
Debugging is difficult and costly. As a programmer looks for a bug, it would be helpful to see a complete trace of events leading to the point of failure. Unfortunately, full tracing is simply too slow to use after deployment, and may even be impractical during testing. We aid post-deployment debugging by giving programmers additional information about(More)
Program coverage is used across many stages of software development. While common during testing, program coverage has also found use outside the test lab, in production software. However, production software has stricter requirements on run-time overheads, and may limit possible program instrumentation. Thus, optimizing the placement of probes to gather(More)
Debugging is difficult. When software fails in production, debugging is even harder, as failure reports usually provide only an incomplete picture of the failing execution. We present a system that answers control-flow queries posed by developers as formal languages, indicating whether the query expresses control flow that is possible or impossible for a(More)
Debugging is difficult and costly. Developers greatly value full traces and complete, reproducible crash recordings, but these are impractical for deployed software. Fortunately, failing applications can leave behind a snapshot of their crashing state in the form of a core dump. Unfortunately, crash data alone often leaves substantial ambiguity in the(More)
Due to resource constraints, tracing production applications often results in incomplete data. Nevertheless, developers ideally want answers to queries about the program's execution beyond data explicitly gathered. For example, a developer may ask whether a particular program statement executed during the run corresponding to a given failure report. In(More)
Prior work proposes inexpensive, tunable tracing of acyclic paths and callsite coverage to enhance post-failure memory dumps. To better understand this data, current work investigates the benefit of each piece of traced data independently, their interplay, future low-cost data to collect, and further analysis uses of the post-mortem data.
Debugging post-deployment failures is difficult, in part because failure reports from these applications usually provide only partial information about what occurred during the failing execution. We introduce approaches that answer control-flow queries about a failing program’s execution based on failure constraints given as formal languages. A key(More)