SCIENCE@home

Baggy Bounds with Accurate Checking

Baozeng Ding,Yeping He,Y. Wu,A. Miller,John Criswell

Published 2012 in 2012 IEEE 23rd International Symposium on Software Reliability Engineering Workshops

ABSTRACT

Baggy Bounds Checking is a backward-compatible defense against out-of-bounds errors. It is reported as being faster than any previous bounds checking tool. However, it enforces allocation bounds instead of object bounds and thus cannot detect memory errors that are in padding areas. In this paper, we present BBAC: a technique that extends Baggy Bounds Checking to enforce accurate bounds checking. The key insight behind our approach is to store the object size at the end of the padding area, making it efficient to lookup object bounds meta-data at runtime. We show experimentally that BBAC can detect more memory errors than Baggy Bounds Checking. Our experiments also show that BBAC only adds an additional 4.39% performance overhead over the original Baggy Bounds Checking technique for the Olden benchmarks and 2x overhead at most on the real-world applications we tested.

PUBLICATION RECORD

  • Publication year

    2012

  • Venue

    2012 IEEE 23rd International Symposium on Software Reliability Engineering Workshops

  • Publication date

    2012-11-01

  • Fields of study

    Computer Science

  • Identifiers
    DOI 10.1109/ISSREW.2012.24
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-27 of 27 references · Page 1 of 1

CITED BY

Showing 1-21 of 21 citing papers · Page 1 of 1