Martin Rinard

TL;DR: It is shown that, for architectures that do not support segmentation in which CPI relies on information hiding, CPI's safe region can be leaked and then maliciously modified by using data pointer overwrites.

TL;DR: A new technique for enabling computations to survive errors and faults while providing a bound on any resulting output distortion, which enables the development of techniques that purposefully fail tasks to reduce the execution time while keeping the distortion within acceptable bounds.

TL;DR: A novel framework for the symbolic bounds analysis of pointers, array indices, and accessed memory regions is presented, which formulates each analysis problem as a system of inequality constraints between symbolic bound polynomials and reduces the constraint system to a linear program.

TL;DR: In this paper, the authors analyze sixteen different configurations of the patch search spaces of SPR and Prophet, two state-of-the-art automatic patch generation systems, and show that correct patches are sparse in the search spaces (typically at most one correct patch per search space per defect), and incorrect patches that nevertheless pass all of the test cases in the validation test suite are typically orders of magnitude more abundant.

TL;DR: A novel framework for the symbolic bounds analysis of pointers, array indices, and accessed memory regions is presented, which formulates each analysis problem as a system of inequality constraints between symbolic bound polynomials and reduces the constraint system to a linear program.