中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
baggy bounds with accurate checking
Author: Ding Baozeng ; He Yeping ; Wu Yanjun ; Miller Alex ; Criswell John
Source: Proceedings - 23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012
Conference Name: 23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012
Conference Date: November 27, 2012 - November 30, 2012
Issued Date: 2012
Conference Place: Dallas, TX, United states
Keyword: Errors ; Technical presentations
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
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.
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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15867
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Ding Baozeng,He Yeping,Wu Yanjun,et al. baggy bounds with accurate checking[C]. 见:23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012. Dallas, TX, United states. November 27, 2012 - November 30, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Ding Baozeng]'s Articles
[He Yeping]'s Articles
[Wu Yanjun]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Ding Baozeng]‘s Articles
[He Yeping]‘s Articles
[Wu Yanjun]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace