Institutional Repository
| baggy bounds with accurate checking | |
| Ding Baozeng; He Yeping; Wu Yanjun; Miller Alex; Criswell John | |
| 2012 | |
| Conference Name | 23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012 |
| Source | Proceedings - 23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012 |
| Pages | 195-200 |
| Conference Date | November 27, 2012 - November 30, 2012 |
| Conference Place | Dallas, TX, United states |
| Indexed Type | EI |
| ISBN | 9780769549286 |
| Department | (1) Institute of Software Chinese Academy of Sciences China; (2) Graduate University Chinese Academy of Sciences China; (3) Department of Computer Science University of Illinois at Urbana-Champaign United States |
| English 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. © 2012 IEEE.; 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. © 2012 IEEE. |
| Keyword | Errors Technical Presentations |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15867 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Ding Baozeng,He Yeping,Wu Yanjun,et al. baggy bounds with accurate checking[C],2012:195-200. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment