14os_dependability课件.pptVIP

  1. 1、本文档共80页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
* This problem has been studied by other researchers, and approaches include … Later in this session we will hear about XFI, a scheme that combines static analysis and software guards like SFI to check a variety of very useful properties for extensions. XFI’s static analysis works at the binary level. In SafeDrive, we look at what we can do if we have the source code to the extension. The question is basically, what can be done at the C language level to better detect and handle bugs in extensions. * * This code declares a struct that contains a pointer, data, to an array of integers. The following code accesses members of that array. The question is, how to check the safety of memory accesses in programs like this. The C compiler doesn’t do this for us because C pointers do not express extent of buffers, unlike high-level languages like Java, where each array has a length at runtime. * However, for any approach based on fat pointers, adding the bounds changed the layout of the struct. If the struct is a global data struct exported by the host program and used by the extension, both sodes have to be changed. This makes them unsuitable for our case where we only want to change the extension. * So instead of using fat pointers, we observe that in this case, the struct actually contains the length of the buffer as another field. Actually the general observation is that bounds info are often available in other fields or variables nearby in the a lot of programs. Therefore for this example, we add an annotation count(len) that tell the compiler this relationship so that it can enforce it. Then the compiler can emit runtime checks when necessary. Then this results in no memory layout change to the data structures and API function. Thus this can be applied to one extension a time. Also note that many of the checks can be optimized away by a clever compiler. For example, the check in this example is not necessary because the loop invariant makes the condition always

您可能关注的文档

文档评论(0)

lifang365 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档