Bounds Checking with Taint-Based Analysis

摘要: We analyze the performance of different bounds checking implementations. Specifically, we examine using x86 bound instruction to reduce run-time overhead. also propose a compiler optimization that prunes checks are not necessary guarantee security. The is based on observation buffer overflow attacks launched through external inputs. Therefore, it sufficient check only accesses those data structures can possibly hold Also, memory writes. proposed optimizations number required as well amount meta-data need be maintained perform checks.