baggy bounds with accurate checking

ISCAS OpenIR

	baggy bounds with accurate checking
	Ding Baozeng; He Yeping; Wu Yanjun; Miller Alex; Criswell John
	2012
会议名称	23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012
会议录名称	Proceedings - 23rd IEEE International Symposium on Software Reliability Engineering Workshops, ISSREW 2012
页码	195-200
会议日期	November 27, 2012 - November 30, 2012
会议地点	Dallas, TX, United states
收录类别	EI
ISBN	9780769549286
部门归属	(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
摘要	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.
关键词	Errors Technical Presentations
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15867
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Ding Baozeng,He Yeping,Wu Yanjun,et al. baggy bounds with accurate checking[C],2012:195-200.