Monday, May 24, 2010

Chaos for a Fast, Secure, and Predictable Future

by John Criswell and Vikram Adve, University of
Illinois at Urbana-Champaign

1 comment:

  1. Violating a program's semantics for fun and profit is a time honored hacker tradition. Compilers defend against such fiends by inserting run-time checks to enforce semantic safety properties such as points-to analysis, type-safety, and reaching definitions analysis. Run-time checks are effective, but they face challenges in performance, memory consumption, and scalability.

    Attackers need semantic safety violations to have predictable behavior. Can a compiler transform code so that violations cause predictably unpredictable behavior? In this paper, we present several new randomization techniques that could be used to enforce semantic safety properties and discuss their potential strengths over the use of run-time checks.